Exploiting the deep structure of constraint problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3649136 (Why is no real title available?)
- scientific article; zbMATH DE number 4162292 (Why is no real title available?)
- scientific article; zbMATH DE number 4162321 (Why is no real title available?)
- scientific article; zbMATH DE number 3769673 (Why is no real title available?)
- scientific article; zbMATH DE number 43242 (Why is no real title available?)
- scientific article; zbMATH DE number 53188 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Optimization by simulated annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
Cited in
(29)- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Revisiting global constraint satisfaction
- Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes
- The hardest constraint problems: A double phase transition
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs.
- Experimental complexity analysis of continuous constraint satisfaction problems.
- A framework for structured quantum search.
- GA performance distributions and randomly generated binary constraint satisfaction problems.
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
- Probabilistic characterization of random Max r-Sat
- Constructive generation of very hard 3-colorability instances
- Phase transitions and the search problem
- The satisfiability constraint gap
- An empirical study of phase transitions in binary constraint satisfaction problems
- Refining the phase transition in combinatorial search
- Locating the phase transition in binary constraint satisfaction problems
- Implicates and prime implicates in random 3-SAT
- A study of complexity transitions on the asymmetric traveling salesman problem
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- Problem structure heuristics and scaling behavior for genetic algorithms
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
- Quantum computation and quantum information†
- EPIDEMIOLOGY MODEL ON SHORTCUT AND SMALL WORLD NETWORKS
- Fine-grained conflict resolution in constraint satisfaction problems
- SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation
- A new method for testing decision procedures in modal logics
- Another look at the phenomenon of phase transition
- Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
This page was built for publication: Exploiting the deep structure of constraint problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342216)
