73 problems
Fix an integer . Let be a weighted bipartite -to- label-cover instance with label sets and and total edge weight…
Let be a label-cover instance whose constraints are alpha-constraints, where an alpha-constraint is defined by permutations…
Core-structure conjecture. Under these hypotheses, every vertex incident with more than linearly many hyperedges shares a second common vertex with all those hyperedges.
Let be a distribution over and let be the associated random uniquely extendable constraint system. Suppose that either and…
Let be a distribution over , and let be the associated random uniquely extendable constraint system. Weakened-support conjecture. Theorem should…
Let be a finite group of order at least two, and let be the random uniquely extendable constraint system arising from the group-equation model described in the s…
Let , and let be a distribution over the set of -ary uniquely extendable constraint functions. Suppose that, if , every function in…
Let and be fixed integers with and . Let be the constant defined in the random -XORSAT satisfiability-threshold theorem. Let be…
Let be a first-order reduct of a finitely bounded homogeneous structure in a finite relational signature. The constraint satisfaction problem…
Tractability conjecture. If does not pp-construct , then
Finite Mal'tsev embedding conjecture. Any predicate over a finite domain with an infinite Mal'tsev embedding also has a finite Mal'tsev embedding. In particular, any predicate with…
Fix . A quantum assignment to a label-cover instance is -compatible when the measurements associated with variables in every subinstance of Gaifman-graph diameter at mo…
Restricted CSP tractability conjecture. If the restricted -template does not rpp-construct , then…
The tractability conjecture. If does not pp-construct , then is polynomial-time solvable.
Homomorphism-embedding CSP conjecture. There is a homogeneous Ramsey structure in a finite relational language, first-order bi-interpretable with , such that the h…
Bodirsky–Pinsker conjecture. If is a first-order reduct of a finitely bounded homogeneous structure in a finite relational language, then either…
Bounded-width boundary conjecture. A homomorphism problem is iff it is not -complete iff it is bounded width.
Abelian embedding conjecture. For a distribution on , Conclusion $$ holds if and only if admits no Abelian embedding.
A constraint satisfaction or optimization problem is a computational problem whose feasible assignments or candidate solutions can be evaluated by its constraints or objective func…
Let be a positive integer, and consider an instance of the two-variable linear system -Lin- over , with equations … An assignment is a map…
Pp-construction conjecture. If is NP-hard, then has a pp-construction in .
Let be a connected core on vertices. Write for the edge relation of , let denote the relational clone generated by , and let…
Let be a finite domain, let be a constraint language on , and let denote the quantified constraint satisfaction problem for . A mighty tuple…
Completeness conjecture. In parts (a) and (b) of the cited dichotomy theorem, is -complete, and…
Fractional-polymorphism classification conjecture. If has no pp-construction in , then is in …