Switch to: Citations

Add references

You must login to add references.
  1. Random constraint satisfaction: Easy generation of hard (satisfiable) instances.Ke Xu, Frédéric Boussemart, Fred Hemery & Christophe Lecoutre - 2007 - Artificial Intelligence 171 (8-9):514-534.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Locating the phase transition in binary constraint satisfaction problems.Barbara M. Smith & Martin E. Dyer - 1996 - Artificial Intelligence 81 (1-2):155-181.
    Download  
     
    Export citation  
     
    Bookmark   10 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  
    • 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-6d5f778f9-6kgst uwo