Imagen de Portada

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Marković, Petar, Maróti, Miklós, McKenzie, Ralph, Prokić, Aleksandar
Formato:	Preprint
Publicado:	2026
Materias:	Computational Complexity Logic in Computer Science Logic 68Q25 (Primary) 08A70, 68Q17, 68Q19 (Secondary)
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Unifying lower bounds for algebraic machines, semantically
por: Seiller, Thomas, et al.
Publicado: (2018)

Some derivations among Logarithmic Space Bounded Counting Classes
por: Janaki, V., et al.
Publicado: (2023)

Undefinability of Approximation of 2-to-2 Games
por: Dawar, Anuj, et al.
Publicado: (2025)

The colored edge theory of A. Bulatov and binary absorption in minimal Taylor algebras
por: Brady, Zarathustra, et al.
Publicado: (2026)

Finitely (In)tractable Promise Constraint Satisfaction Problems
por: Asimi, Kristina, et al.
Publicado: (2020)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
por: Dorochko, Leonid, et al.
Publicado: (2026)

Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity
por: Ham, Lucy, et al.
Publicado: (2022)

Ineffectiveness for Search and Undecidability of PCSP Meta-Problems
por: Larrauri, Alberto
Publicado: (2025)

The Complexity of Resilience for Digraph Queries
por: Bodirsky, Manuel, et al.
Publicado: (2026)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
por: Bodirsky, Manuel, et al.
Publicado: (2024)

The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
por: Kátay, Tamás, et al.
Publicado: (2023)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
por: Bodirsky, Manuel, et al.
Publicado: (2023)

Choiceless Polynomial Space
por: Ferrarotti, Flavio, et al.
Publicado: (2024)

Polynomial Identity Testing via Evaluation of Rational Functions
por: Hu, Ivan, et al.
Publicado: (2022)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
por: Lin, Tianrong
Publicado: (2023)

Quantifying The Limits of AI Reasoning: Systematic Neural Network Representations of Algorithms
por: Kratsios, Anastasis, et al.
Publicado: (2025)

A Physical Analogy between Molecular Ordering and SAT-to-Ising Annealing
por: Dubey, ShivKishan, et al.
Publicado: (2025)

Game Comonads & Generalised Quantifiers
por: Conghaile, Adam Ó, et al.
Publicado: (2020)

An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
por: Lela, Marko
Publicado: (2025)

Behavioural Theory of Reflective Algorithms II: Reflective Parallel Algorithms
por: Schewe, Klaus-Dieter, et al.
Publicado: (2025)

A Complete Fragment of LTL(EB)
por: Ferrarotti, Flavio, et al.
Publicado: (2024)

A Formalization of Abstract Rewriting in Agda
por: Arkle, Sam, et al.
Publicado: (2026)

Computational Complexity of Model-Checking Quantum Pushdown Systems
por: Lin, Deren, et al.
Publicado: (2025)

Polynomial definability in constraint languages with few subpowers
por: Bulín, Jakub, et al.
Publicado: (2023)

The equational theory of the Weihrauch lattice with multiplication
por: Neumann, Eike, et al.
Publicado: (2024)

The Separation of $NP$ and $PSPACE$
por: Lin, Tianrong
Publicado: (2021)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
por: Alpay, Faruk, et al.
Publicado: (2026)

P not equal to NP
por: Delgado, Daniel Cardona
Publicado: (2023)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
por: Abdullah, Duaa, et al.
Publicado: (2025)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
por: Grochow, Joshua A., et al.
Publicado: (2021)

Count-Free Weisfeiler--Leman and Group Isomorphism
por: Collins, Nathaniel A., et al.
Publicado: (2022)

Languages given by Finite Automata over the Unary Alphabet
por: Czerwiński, Wojciech, et al.
Publicado: (2023)

Quantum Random Self-Modifiable Computation
por: Fiske, Michael Stephen
Publicado: (2018)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Completeness classes in algebraic complexity theory
por: Bürgisser, Peter
Publicado: (2024)

Monitoring Hyperproperties over Observed and Constructed Traces
por: Chalupa, Marek, et al.
Publicado: (2025)

Simulating and model checking membrane systems using strategies in Maude
por: Rubio, Rubén, et al.
Publicado: (2024)

There is a deep 1-generic set
por: Li, Ang
Publicado: (2024)

Flexible constraint satisfiability and a problem in semigroup theory
por: Jackson, Marcel
Publicado: (2015)

On Woolhouse's Cotton-Spinning Problem
por: Groote, Jan Friso, et al.
Publicado: (2024)