Cover Image

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barto, Libor, Brady, Zarathustra, Bulatov, Andrei, Kozik, Marcin, Zhuk, Dmitriy
Format:	Preprint
Published:	2021
Subjects:	Computational Complexity Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
by: Barto, Libor, et al.
Published: (2026)

A simplified proof of the CSP Dichotomy Conjecture and XY-symmetric operations
by: Zhuk, Dmitriy
Published: (2024)

Modular Counting CSP: Reductions and Algorithms
by: Kazeminia, Amirhossein, et al.
Published: (2025)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
by: Zhuk, Dmitriy
Published: (2024)

The Rise of Plurimorphisms: Algebraic Approach to Approximation
by: Barto, Libor, et al.
Published: (2024)

Singleton algorithms for the Constraint Satisfaction Problem
by: Zhuk, Dmitriy
Published: (2025)

The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)

Complexity classification of counting graph homomorphisms modulo a prime number
by: Bulatov, Andrei A., et al.
Published: (2021)

Discrete Homotopy and Promise Constraint Satisfaction Problem
by: Beikmohammadi, Arash, et al.
Published: (2025)

Notes on CSPs and Polymorphisms
by: Brady, Zarathustra
Published: (2022)

Classical Simulation of Quantum CSP Strategies
by: Banakh, Demian, et al.
Published: (2025)

Satisfiability of commutative vs. non-commutative CSPs
by: Bulatov, Andrei A., et al.
Published: (2024)

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

The Richness of CSP Non-redundancy
by: Brakensiek, Joshua, et al.
Published: (2025)

The Ideal Membership Problem and Abelian Groups
by: Bulatov, Andrei A., et al.
Published: (2022)

Proof complexity of Mal'tsev CSP
by: Gaysin, Azza
Published: (2025)

Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
by: Nishiyama, Yumiko
Published: (2025)

Spectra of Cardinality Queries over Description Logic Knowledge Bases
by: Manière, Quentin, et al.
Published: (2024)

Local structure of idempotent algebras I
by: Bulatov, Andrei A.
Published: (2020)

Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
by: Nechesov, Andrey
Published: (2024)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

An order out of nowhere: a new algorithm for infinite-domain CSPs
by: Mottet, Antoine, et al.
Published: (2023)

The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)

Parallelism and Adaptivity in Student-Teacher Witnessing
by: Ježil, Ondřej, et al.
Published: (2026)

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

On the consistency of stronger lower bounds for NEXP
by: Thapen, Neil
Published: (2025)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)

Better Extension Variables in DQBF via Independence
by: Chew, Leroy, et al.
Published: (2025)

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
by: Dwivedi, Prateek, et al.
Published: (2026)

Semi-Algebraic Proof Systems for QBF
by: Beyersdorff, Olaf, et al.
Published: (2025)

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations
by: Antonelli, Melissa, et al.
Published: (2025)

Minimal Model Reasoning in Description Logics: Don't Try This at Home!
by: Di Stefano, Federica, et al.
Published: (2025)

The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems
by: Barto, Libor, et al.
Published: (2024)

Local structure of idempotent algebras II
by: Bulatov, Andrei A.
Published: (2020)

Temporal Team Semantics Revisited
by: Gutsfeld, Jens Oliver, et al.
Published: (2021)

Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
by: Beyersdorff, Olaf, et al.
Published: (2021)

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
by: Lemke, Caroline, et al.
Published: (2025)

On the Number of Quantifiers Needed to Define Boolean Functions
by: Carmosino, Marco, et al.
Published: (2024)