Bounding the scaling window of random constraint satisfaction problems
From MaRDI portal
Publication:5963651
Recommendations
Cites work
- scientific article; zbMATH DE number 1256700 (Why is no real title available?)
- scientific article; zbMATH DE number 1369843 (Why is no real title available?)
- scientific article; zbMATH DE number 1448978 (Why is no real title available?)
- A general model and thresholds for random constraint satisfaction problems
- Analysis of Two Simple Heuristics on a Random Instance ofk-sat
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Large hypertree width for sparse random hypergraphs
- Locating the phase transition in binary constraint satisfaction problems
- Many hard examples in exact phase transitions
- Models and thresholds for random constraint satisfaction problems
- On the constraint length of random \(k\)-CSP
- On the phase transitions of random \(k\)-constraint satisfaction problems
- Probability and Computing
- Random \(k\)-SAT: A tight threshold for moderately growing \(k\)
- Random constraint satisfaction: A more accurate picture
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- The scaling window of the 2-SAT transition
- Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
This page was built for publication: Bounding the scaling window of random constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963651)