A proof of the CSP dichotomy conjecture
D Zhuk - Journal of the ACM (JACM), 2020 - dl.acm.org
Many natural combinatorial problems can be expressed as constraint satisfaction problems.
This class of problems is known to be NP-complete in general, but certain restrictions on the …
This class of problems is known to be NP-complete in general, but certain restrictions on the …
The wonderland of reflections
A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a
fixed template is that pp-interpretations between at most countable ω-categorical relational …
fixed template is that pp-interpretations between at most countable ω-categorical relational …
Schaefer's theorem for graphs
M Bodirsky, M Pinsker - Journal of the ACM (JACM), 2015 - dl.acm.org
Schaefer's theorem is a complexity classification result for so-called Boolean constraint
satisfaction problems: it states that every Boolean constraint satisfaction problem is either …
satisfaction problems: it states that every Boolean constraint satisfaction problem is either …
The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
We prove that an ω-categorical core structure primitively positively interprets all finite
structures with parameters if and only if some stabilizer of its polymorphism clone has a …
structures with parameters if and only if some stabilizer of its polymorphism clone has a …
Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems)
The tractability conjecture for finite domain constraint satisfaction problems (CSPs) stated
that such CSPs are solvable in polynomial time whenever there is no natural reduction, in …
that such CSPs are solvable in polynomial time whenever there is no natural reduction, in …
Ramsey classes: examples and constructions.
M Bodirsky - Surveys in combinatorics, 2015 - books.google.com
This article is concerned with classes of relational structures that are closed under taking
substructures and isomorphism, that have the joint embedding property, and that …
substructures and isomorphism, that have the joint embedding property, and that …
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems
L Barto, M Kompatscher, M Olšák… - 2017 32nd Annual …, 2017 - ieeexplore.ieee.org
There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely
bounded homogeneous structures: the first one states that tractability of the CSP of such a …
bounded homogeneous structures: the first one states that tractability of the CSP of such a …
Promise constraint satisfaction: Algebraic structure and a symmetric boolean dichotomy
J Brakensiek, V Guruswami - SIAM Journal on Computing, 2021 - SIAM
A classic result due to Schaefer Proceedings of STOC 78, ACM, 1978, pp. 216--226
classifies all constraint satisfaction problems (CSPs) over the Boolean domain as being …
classifies all constraint satisfaction problems (CSPs) over the Boolean domain as being …
Constraint satisfaction problems for reducts of homogeneous graphs
For n≧3, let (H_n,E) denote the n th Henson graph, ie, the unique countable homogeneous
graph with exactly those finite graphs as induced subgraphs that do not embed the complete …
graph with exactly those finite graphs as induced subgraphs that do not embed the complete …
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
M Bodirsky, F Madelaine, A Mottet - … of the 33rd Annual ACM/IEEE …, 2018 - dl.acm.org
The logic MMSNP is a restricted fragment of existential second-order logic which allows to
express many interesting queries in graph theory and finite model theory. The logic was …
express many interesting queries in graph theory and finite model theory. The logic was …