Conditional dichotomy of Boolean ordered promise CSPs

Cites work

scientific article; zbMATH DE number 4145701 (Why is no real title available?)
scientific article; zbMATH DE number 3503316 (Why is no real title available?)
scientific article; zbMATH DE number 7561550 (Why is no real title available?)
A dichotomy theorem for nonuniform CSPs
A proof of the CSP dichotomy conjecture
An approximate zero-one law
Analysis of Boolean Functions
Classifying the Complexity of Constraints Using Finite Algebras
Closure properties of constraints
Efficient computation of the Shapley value for game-theoretic network centrality
Galois theory for minors of finite functions
Improved hardness for \(H\)-colourings of \(G\)-colourable graphs
New hardness results for graph and hypergraph colorings
On independent sets, 2-to-2 games, and Grassmann graphs
On non-optimally expanding sets in Grassmann graphs
On rich 2-to-1 games
On the algebraic structure of combinatorial problems
On the power of unique 2-prover 1-round games
Promise constraint satisfaction: structure theory and a symmetric Boolean dichotomy
Pseudorandom sets in Grassmann graph have near-perfect expansion
Social Indeterminacy
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
The complexity of 3-colouring \(\mathbf{H}\)-colourable graphs
The complexity of satisfiability problems
The inverse Shapley value problem
The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
Towards a proof of the 2-to-1 games conjecture?
(2+)-Sat is NP-hard

This page was built for publication: Conditional dichotomy of Boolean ordered promise CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241134)