Refining the phase transition in combinatorial search
From MaRDI portal
Recommendations
- Complexity-theoretic models of phase transitions in search problems
- An empirical study of phase transitions in binary constraint satisfaction problems
- The satisfiability constraint gap
- Locating the phase transition in binary constraint satisfaction problems
- Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study
Cites work
- A Parallel Graph Coloring Heuristic
- A technique for colouring a graph applicable to large scale timetabling problems
- Almost all k-colorable graphs are easy to color
- An empirical study of phase transitions in binary constraint satisfaction problems
- Easy problems are sometimes hard
- Exploiting the deep structure of constraint problems
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
- 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 3654183 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (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
- The hardest constraint problems: A double phase transition
- The solution of some random NP-hard problems in polynomial expected time
Cited in
(18)- Complexity-theoretic models of phase transitions in search problems
- Compiling constraint satisfaction problems
- Dual mean field search for large scale linear and quadratic knapsack problems
- Dual mean field annealing scheme for binary optimization under linear constraints
- Phase transitions and the search problem
- An empirical study of phase transitions in binary constraint satisfaction problems
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study
- Average-case complexity of backtrack search for coloring sparse random graphs
- scientific article; zbMATH DE number 1149446 (Why is no real title available?)
- scientific article; zbMATH DE number 2084722 (Why is no real title available?)
- Complexity of coloring random graphs: an experimental study of the hardest region
- scientific article; zbMATH DE number 6917125 (Why is no real title available?)
- Methods and Applications of Artificial Intelligence
- Phase Transitions in Combinatorial Optimization Problems
- Artificial Intelligence: Methodology, Systems, and Applications
- SOFSEM 2004: Theory and Practice of Computer Science
- On market-inspired approaches to propositional satisfiability
This page was built for publication: Refining the phase transition in combinatorial search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674181)
