Peter Cheeseman, Bob Kanefsky, William M. Taylor  Home/Search
Context Related
Links: DBLP | nasa.gov/ic/project...phasesforweb.ps nasa.gov/ic/project...phasesforweb.ps unh.edu/pub/csp/ar...hardijcai91.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: nasa.gov/ic/projects/bayesgro... (more) From: nasa.gov/ic/projects/bayesgro... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is well known that for many NP-complete problems, such as K-Sat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P 6= NP ). This paper shows that NP-complete problems can be summarized by at least one "order parameter ", and that the hard problems occur at a critical value of such a parameter. This critical value separates two regions of characteristically different properties. For example, for K-colorability, the critical value separates... (Update)
Cited by: More
Martin Pelikan, Kumara Sastry, Martin V. Butz, and David E.. - Medal Report No (Correct)
RRT-blossom: RRT with a local flood-fill behavior - Maciej Kalisiak Dept (2006) (Correct)
An Experimental Study on the Complexity of Left-Deep.. - König-Ries, Helmer.. (1995) (Correct)
Active bibliography (related documents): More All
0.6: The Statistical Mechanics of k-Satisfaction - Kirkpatrick, Gyorgyi (1994) (Correct)
0.1: Phase Transitions and Annealed Theories: Number Partitioning as .. - Gent, Walsh (1996) (Correct)
0.1: The Number Partition Phase Transition - Ian P. Gent, Toby Walsh (1995) (Correct)
Similar documents based on text: More All
0.2: The Constrainedness of Search - Gent, MacIntyre, Prosser, Walsh (1996) (Correct)
0.2: Bibliography - Achh Rajeev Alur (Correct)
0.2: Sparse Constraint Graphs and Exceptionally Hard Problems - Smith, Grant (1995) (Correct)
Related documents from co-citation: More All
43: Hard and easy distributions of sat problems - Mitchell, Selman et al. - 1992
35: Hybrid algorithms for the constraint satisfaction problem (context) - Prosser - 1993
28: Increasing tree search efficiency for constraint satisfaction problems (context) - Haralick, Elliott - 1980
BibTeX entry: (Update)
Cheeseman, P., Kanefsky, B., & Taylor, W. (1991). Where the really hard problems are. http://citeseer.ist.psu.edu/cheeseman91where.html More
@inproceedings{ cheeseman91where,
author = "Peter Cheeseman and Bob Kanefsky and William M. Taylor",
title = "{Where the Really Hard Problems Are}",
booktitle = "Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, {IJCAI}-91, Sidney, Australia",
pages = "331--337",
year = "1991",
url = "citeseer.ist.psu.edu/cheeseman91where.html" }
Citations (may not include all citations):4212 Computers and Intractability': A Guide to the Theory of NPCo.. (context) - Garey, Johnson - 1979
283 Random Graphs (context) - Bollobas - 1985 ACM
135 Solving Large-Scale Constraint Satisfaction and Scheduling P.. (context) - Minton - 1990
45 Search Rearrangement Backtracking and Polynomial Average Tim.. (context) - Purdom - 1983 DBLP
25 An Algorithm for the Traveling Salesman Problem (context) - Little - 1963
22 Phase Transitions in Artificial Intelligence Systems (context) - Huberman, Hogg - 1987 ACM DBLP
16 Searching for an Optimal Path in a Tree with Random Costs (context) - Karp, Pearl - 1983 DBLP
9 Almost All k-Colorable Graphs are Easy to Color (context) - Turner - 1988 DBLP
8 The Uses and Abuses of Statistical Mechanics in Computationa.. (context) - Fu - 1989
2 Statistical Mechanics and Disordered Systems (context) - Kirkpatrick, Swendsen - 1985 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC