Random constraint satisfaction: A more accurate picture
From MaRDI portal
Recommendations
- A general model and thresholds for random constraint satisfaction problems
- Principles and Practice of Constraint Programming – CP 2004
- Models for Random Constraint Satisfaction Problems
- scientific article; zbMATH DE number 5547880
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Cited in
(43)- The SAT-UNSAT transition for random constraint satisfaction problems
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- When does the giant component bring unsatisfiability?
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs.
- How far from a worst solution a random solution of a \(k\) CSP instance can be?
- GA performance distributions and randomly generated binary constraint satisfaction problems.
- On the constraint length of random \(k\)-CSP
- Many hard examples in exact phase transitions
- Partition search for non-binary constraint satisfaction
- Typical case complexity of satisfiability algorithms and the threshold phenomenon
- Unsatisfiability bounds for random CSPs from an energetic interpolation method
- A study of pure random walk algorithms on constraint satisfaction problems with growing domains
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
- On Random Ordering Constraints
- Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story
- Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
- Expected number of locally maximal solutions for random Boolean CSPs
- A general model and thresholds for random constraint satisfaction problems
- Sharp thresholds for constraint satisfaction problems and homomorphisms
- scientific article; zbMATH DE number 5547880 (Why is no real title available?)
- Unbiased statistics of a constraint satisfaction problem - a controlled-bias generator
- scientific article; zbMATH DE number 1448978 (Why is no real title available?)
- Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
- A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming
- scientific article; zbMATH DE number 7301529 (Why is no real title available?)
- A model for phase transition of random answer-set programs
- The satisfiability threshold for randomly generated binary constraint satisfaction problems
- Another look at the phenomenon of phase transition
- Principles and Practice of Constraint Programming – CP 2004
- The satisfiability threshold for randomly generated binary constraint satisfaction problems
- Random constraint satisfaction: Flaws and structure
- Rigorous results for random (2+p)-SAT
- Results related to threshold phenomena research in satisfiability: Lower bounds
- Lower bounds for random 3-SAT via differential equations
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
- Bounding the scaling window of random constraint satisfaction problems
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
- Estimating satisfiability
- Balanced random constraint satisfaction: phase transition and hardness
- Statistical regimes across constrainedness regions
- Identifying and exploiting problem structures using explanation-based constraint programming
- The scaling window of the model \(d\)-\(k\)-CSP
- An upper (lower) bound for Max (Min) CSP
This page was built for publication: Random constraint satisfaction: A more accurate picture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5949018)
