Constructing an asymptotic phase transition in random binary constraint satisfaction problems
From MaRDI portal
Recommendations
- Locating the phase transition in binary constraint satisfaction problems
- Random constraint satisfaction: A more accurate picture
- An empirical study of phase transitions in binary constraint satisfaction problems
- A general model and thresholds for random constraint satisfaction problems
- scientific article; zbMATH DE number 1448978
Cites work
- A Sufficient Condition for Backtrack-Free Search
- An empirical study of phase transitions in binary constraint satisfaction problems
- Exploiting the deep structure of constraint problems
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1448978 (Why is no real title available?)
- Lower bounds for random 3-SAT via differential equations
- Random constraint satisfaction: Flaws and structure
- Results related to threshold phenomena research in satisfiability: Lower bounds
- Sudden emergence of a giant k-core in a random graph
- The hardest constraint problems: A double phase transition
Cited in
(16)- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length
- Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP
- Many hard examples in exact phase transitions
- An empirical study of phase transitions in binary constraint satisfaction problems
- Locating the phase transition in binary constraint satisfaction problems
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
- A Model to Study Phase Transition and Plateaus in Relational Learning
- A general model and thresholds for random constraint satisfaction problems
- scientific article; zbMATH DE number 5547881 (Why is no real title available?)
- Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
- On the phase transitions of random \(k\)-constraint satisfaction problems
- scientific article; zbMATH DE number 6469137 (Why is no real title available?)
- Random constraint satisfaction: A more accurate picture
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
- The scaling window of the model \(d\)-\(k\)-CSP
This page was built for publication: Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958810)
