Random constraint satisfaction: Flaws and structure
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7301529
- Models for Random Constraint Satisfaction Problems
- Random constraint satisfaction: A more accurate picture
- scientific article; zbMATH DE number 1002207
- scientific article; zbMATH DE number 5547880
- Randomized approximation of the constraint satisfaction problem
- The Resolution Complexity of Random Constraint Satisfaction Problems
- Constraint satisfaction: random regular k-SAT
- The satisfiability threshold for a seemingly intractable random constraint satisfaction problem
- A general model and thresholds for random constraint satisfaction problems
Cited in
(36)- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Reasoning from last conflict(s) in constraint programming
- When does the giant component bring unsatisfiability?
- Backtracking and random constraint satisfaction
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs.
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- 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
- Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs
- Many hard examples in exact phase transitions
- Partition search for non-binary constraint satisfaction
- Explorative anytime local search for distributed constraint optimization
- On the freezing of variables in random constraint satisfaction problems
- Resolution complexity of random constraint satisfaction problems: Another half of the story
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
- Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story
- 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?)
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework
- Models for Random Constraint Satisfaction Problems
- New algorithms for bidirectional singleton arc consistency
- scientific article; zbMATH DE number 1420826 (Why is no real title available?)
- Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
- The solution space structure of planted constraint satisfaction problems with growing domains
- scientific article; zbMATH DE number 7301529 (Why is no real title available?)
- On the Integration of Singleton Consistencies and Look-Ahead Heuristics
- On the phase transitions of random \(k\)-constraint satisfaction problems
- Another look at the phenomenon of phase transition
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
- Combinatorial sharpness criterion and phase transition classification for random CSPs
- Interleaving solving and elicitation of constraint satisfaction problems based on expected cost
- Is computational complexity a barrier to manipulation?
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
- The impact of search heuristics on heavy-tailed behaviour
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
This page was built for publication: Random constraint satisfaction: Flaws and structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5949019)
