Locating the phase transition in binary constraint satisfaction problems
From MaRDI portal
Recommendations
- An empirical study of phase transitions in binary constraint satisfaction problems
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
- Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
- The satisfiability constraint gap
- On the phase transitions of random \(k\)-constraint satisfaction problems
Cites work
- scientific article; zbMATH DE number 3902655 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- An empirical study of phase transitions in binary constraint satisfaction problems
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Exploiting the deep structure of constraint problems
- Network-based heuristics for constraint-satisfaction problems
Cited in
(32)- Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard
- Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP
- Backtracking algorithms for disjunctions of temporal constraints
- Modelling and solving temporal reasoning as propositional satisfiability
- A Model to Study Phase Transition and Plateaus in Relational Learning
- Hybrid search for minimal perturbation in dynamic CSPs
- Frozen development in graph coloring
- Concurrent search for distributed CSPs
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs.
- An empirical study of phase transitions in binary constraint satisfaction problems
- Reasoning from last conflict(s) in constraint programming
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- scientific article; zbMATH DE number 2084721 (Why is no real title available?)
- scientific article; zbMATH DE number 2084722 (Why is no real title available?)
- Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
- A general model and thresholds for random constraint satisfaction problems
- Refining the phase transition in combinatorial search
- On the phase transitions of random \(k\)-constraint satisfaction problems
- scientific article; zbMATH DE number 1369843 (Why is no real title available?)
- Phase transitions of contingent planning problem
- Partition search for non-binary constraint satisfaction
- An upper (lower) bound for Max (Min) CSP
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
- Bounding the scaling window of random constraint satisfaction problems
- Phase transitions in integer linear problems
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- The solution space structure of planted constraint satisfaction problems with growing domains
- Phase Transition for Maximum Not-All-Equal Satisfiability
- Phase transitions of PP-complete satisfiability problems
- A Lagrangian reconstruction of GENET
- Constraint satisfaction -- algorithms and complexity analysis
This page was built for publication: Locating the phase transition in binary constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674182)
