Image de couverture de livre

Singleton algorithms for the Constraint Satisfaction Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Zhuk, Dmitriy
Format:	Preprint
Publié:	2025
Sujets:	Logic in Computer Science Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
par: Barto, Libor, et autres
Publié: (2026)

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

The complete classification for quantified equality constraints
par: Zhuk, Dmitriy, et autres
Publié: (2021)

Discrete Homotopy and Promise Constraint Satisfaction Problem
par: Beikmohammadi, Arash, et autres
Publié: (2025)

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras
par: Barto, Libor, et autres
Publié: (2021)

The Constraint Satisfaction Problem Over Multisorted Cores
par: Delic, Dejan, et autres
Publié: (2025)

Network Satisfaction Problems Solved by k-Consistency
par: Bodirsky, Manuel, et autres
Publié: (2023)

The Proof Analysis Problem
par: Arteche, Noel, et autres
Publié: (2025)

An order out of nowhere: a new algorithm for infinite-domain CSPs
par: Mottet, Antoine, et autres
Publié: (2023)

Near-Optimal Encodings of Cardinality Constraints
par: Krapivin, Andrew, et autres
Publié: (2026)

On the Complexity of the Skolem Problem at Low Orders
par: Bacik, Piotr, et autres
Publié: (2025)

On the Descriptive Complexity of Vertex Deletion Problems
par: Bannach, Max, et autres
Publié: (2024)

The Descriptive Complexity of Relation Modification Problems
par: Chudigiewitsch, Florian, et autres
Publié: (2026)

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
par: Lemke, Caroline, et autres
Publié: (2025)

Effective Versions of Strong Measure Zero
par: Rayman, Matthew
Publié: (2025)

Meta-Mathematics of Computational Complexity Theory
par: Oliveira, Igor C.
Publié: (2025)

On the consistency of stronger lower bounds for NEXP
par: Thapen, Neil
Publié: (2025)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
par: Nechesov, Andrey
Publié: (2024)

Proof Complexity of Linear Logics
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2026)

Proof complexity of positive branching programs
par: Das, Anupam, et autres
Publié: (2021)

Parallelism and Adaptivity in Student-Teacher Witnessing
par: Ježil, Ondřej, et autres
Publié: (2026)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
par: Atserias, Albert, et autres
Publié: (2024)

Finitely (In)tractable Promise Constraint Satisfaction Problems
par: Asimi, Kristina, et autres
Publié: (2020)

The Network Satisfaction Problem for Relation Algebras with at most 4 Atoms
par: Bodirsky, Manuel, et autres
Publié: (2025)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
par: Marković, Petar, et autres
Publié: (2026)

Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations
par: Bournez, Olivier, et autres
Publié: (2024)

Better Extension Variables in DQBF via Independence
par: Chew, Leroy, et autres
Publié: (2025)

Modular Counting CSP: Reductions and Algorithms
par: Kazeminia, Amirhossein, et autres
Publié: (2025)

On the Interplay of Cube Learning and Dependency Schemes in QCDCL Proof Systems
par: Choudhury, Abhimanyu, et autres
Publié: (2025)

Uniformity within Parameterized Circuit Classes
par: Hegeman, Steef, et autres
Publié: (2025)

Symmetric Proofs in the Ideal Proof System
par: Dawar, Anuj, et autres
Publié: (2025)

On Middle Grounds for Preference Statements
par: George, Anne-Marie, et autres
Publié: (2025)

Fagin's Theorem for Semiring Turing Machines
par: Badia, Guillermo, et autres
Publié: (2025)

Model Counting for Dependency Quantified Boolean Formulas
par: Fung, Long-Hin, et autres
Publié: (2025)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
par: Krebs, Andreas, et autres
Publié: (2025)

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations
par: Antonelli, Melissa, et autres
Publié: (2025)

Logic and Computation through the Lens of Semirings
par: Barlag, Timon, et autres
Publié: (2025)

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

Testing for Renamability to Classes of Clause Sets
par: Brandl, Albert, et autres
Publié: (2025)