|
501
|
Where the really hard problems are
– Peter Cheeseman, Bob Kanefsky, William M. Taylor
- 1991
|
|
27
|
Scaling Effects in the CSP Phase Transition
– Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
- 1995
|
|
104
|
Locating the Phase Transition in Binary Constraint Satisfaction Problems
– B. M. Smith
- 1994
|
|
70
|
Exploiting the deep structure of constraint problems
– Colin Williams, Tad Hogg
- 1994
|
|
55
|
An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem
– Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh
- 1996
|
|
266
|
and Easy Distributions for SAT Problems
– Hard
- 1992
|
|
71
|
The Phase Transition and the Mushy Region in Constraint Satisfaction Problems
– B Smith
- 1994
|
|
194
|
Hard and Easy Distributions of SAT Problems
– David Mitchell, Bart Selman, Hector Levesque
- 1992
|
|
75
|
Easy Problems are Sometimes Hard
– Ian Gent, Toby Walsh
- 1994
|
|
73
|
Random Constraint Satisfaction: A More Accurate Picture
– Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Y. Stamatiou
- 1997
|
|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
719
|
Adaptive Constraint Satisfaction
– J. E. Borrett, E. P. K. Tsang, N. R. Walsh
- 1996
|
|
293
|
New method to color the vertices of a graph
– D Brelaz
- 1979
|
|
23
|
Finite-size scaling
– M N Barber
- 1983
|
|
37
|
Critical behavior in the computational cost of satisfiability testing
– Bart Selman, Scott Kirkpatrick
- 1996
|
|
105
|
An empirical study of phase transitions in binary constraint satisfaction problems
– P Prosser
- 1996
|
|
78
|
The hardest constraint problems: A double phase transition
– Tad Hogg, Colin Williams
- 1994
|
|
47
|
An Empirical Analysis of Search in GSAT
– Ian Gent, Toby Walsh
- 1993
|
|
318
|
Noise strategies for improving local search
– Bart Selman, Henry A. Kautz, Bram Cohen
- 1994
|
