Where the really hard problems are (1991)

Cached

Download Links

by Peter Cheeseman , Bob Kanefsky , William M. Taylor
Citations:576 - 1 self

Documents Related by Co-Citation

462 Increasing tree search efficiency for constraint satisfaction problems – Robert M Haralick, Gordon L Elliott - 1980
283 and easy distributions of sat problems – Hard - 1992
202 Experimental Results on the Crossover Point in Satisfiability Problems – James M. Crawford, Larry D. Auton - 1993
683 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
90 Backtrack programming – S W GOLOMB, L D BAUMERT - 1965
948 Constraint Networks – Rina Dechter - 1992
1000 Consistency in networks of relations – A K Mackworth - 1977
811 Adaptive Constraint Satisfaction – J. E. Borrett, E. P. K. Tsang, N. R. Walsh - 1996
398 Minimizing Conflicts: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems – Steven Minton, Andy Philips, Mark D. Johnston, Philip Laird - 1993
397 Network-based heuristics for constraint satisfaction problems – R Dechter, J Pearl - 1987
41 Using Deep Structure to Locate Hard Problems – Colin P. Williams, Tad Hogg - 1992
73 Exploiting the deep structure of constraint problems – Colin Williams, Tad Hogg - 1994
350 Hybrid Algorithms for the Constraint Satisfaction Problem – Patrick Prosser - 1993
360 GSAT and Dynamic Backtracking – Matthew L. Ginsberg, David A. McAllester - 1994
274 Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition – Rina Dechter - 1990
246 Synthesizing constraint expressions – E C Freuder - 1978
175 Performance Measurement and Analysis of Certain Search Algorithms – J Gaschnig - 1979
424 Networks of constraints: Fundamental properties and applications to picture processing – U Montanari - 1974
123 Constraint satisfaction algorithms – B A Nadel - 1989