Switch to: References

Add citations

You must login to add citations.
  1. Refining the phase transition in combinatorial search.Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):127-154.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes.P. Parodi, R. Lancewicki, A. Vijh & J. K. Tsotsos - 1998 - Artificial Intelligence 105 (1-2):47-75.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Critical behavior in the computational cost of satisfiability testing.Bart Selman & Scott Kirkpatrick - 1996 - Artificial Intelligence 81 (1-2):273-295.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The TSP phase transition.Ian P. Gent & Toby Walsh - 1996 - Artificial Intelligence 88 (1-2):349-358.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The satisfiability constraint gap.Ian P. Gent & Toby Walsh - 1996 - Artificial Intelligence 81 (1-2):59-80.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Easy problems are sometimes hard.Ian P. Gent & Toby Walsh - 1994 - Artificial Intelligence 70 (1-2):335-345.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Experimental results on the crossover point in random 3-SAT.James M. Crawford & Larry D. Auton - 1996 - Artificial Intelligence 81 (1-2):31-57.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Implicates and prime implicates in Random 3-SAT.Robert Schrag & James M. Crawford - 1996 - Artificial Intelligence 81 (1-2):199-222.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Problem structure heuristics and scaling behavior for genetic algorithms.Scott H. Clearwater & Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):327-347.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • Phase transitions and the search problem.Tad Hogg, Bernardo A. Huberman & Colin P. Williams - 1996 - Artificial Intelligence 81 (1-2):1-15.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6b65f85844-fbfkv uwo