Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story
From MaRDI portal
Recommendations
- Resolution complexity of random constraint satisfaction problems: Another half of the story
- The Resolution Complexity of Random Constraint Satisfaction Problems
- A dichotomy theorem for the resolution complexity of random constraint satisfaction problems
- On the constraint length of random \(k\)-CSP
- The satisfiability threshold for a seemingly intractable random constraint satisfaction problem
Cites work
- A perspective on certain polynomial-time solvable classes of satisfiability
- Approximating the unsatisfiability threshold of random formulas
- scientific article; zbMATH DE number 1754601 (Why is no real title available?)
- Lower bounds for random 3-SAT via differential equations
- Models and thresholds for random constraint satisfaction problems
- Random constraint satisfaction: A more accurate picture
- Random constraint satisfaction: Flaws and structure
- The phase transition in a random hypergraph
- Upper bounds on the satisfiability threshold
Cited in
(6)- On the constraint length of random \(k\)-CSP
- Many hard examples in exact phase transitions
- Resolution complexity of random constraint satisfaction problems: Another half of the story
- A dichotomy theorem for the resolution complexity of random constraint satisfaction problems
- The Resolution Complexity of Random Constraint Satisfaction Problems
- Spines of random constraint satisfaction problems: definition and connection with computational complexity
This page was built for publication: Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439112)
