The hardest constraint problems: A double phase transition

&
Artificial Intelligence 69 (1-2):359-377 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(94)90088-4

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Locating the phase transition in binary constraint satisfaction problems.Barbara M. Smith & Martin E. Dyer - 1996 - Artificial Intelligence 81 (1-2):155-181.
On the phase transitions of random k-constraint satisfaction problems.Yun Fan & Jing Shen - 2011 - Artificial Intelligence 175 (3-4):914-927.
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
The SAT Phase Transition.Ian Philip Gent & Toby Walsh - 1994 - Department of Artificial Intelligence, University of Edinburgh.
The TSP phase transition.Ian P. Gent & Toby Walsh - 1996 - Artificial Intelligence 88 (1-2):349-358.
Refining the phase transition in combinatorial search.Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):127-154.
Phase transition in a random NK landscape model.Sung-Soon Choi, Kyomin Jung & Jeong Han Kim - 2008 - Artificial Intelligence 172 (2-3):179-203.
Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.
Hybrid tractability of valued constraint problems.Martin C. Cooper & Stanislav Živný - 2011 - Artificial Intelligence 175 (9-10):1555-1569.
Solving quantified constraint satisfaction problems.Ian P. Gent, Peter Nightingale, Andrew Rowley & Kostas Stergiou - 2008 - Artificial Intelligence 172 (6-7):738-771.

Analytics

Added to PP
2020-12-22

Downloads
11 (#1,459,590)

6 months
3 (#1,061,821)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Easy problems are sometimes hard.Ian P. Gent & Toby Walsh - 1994 - Artificial Intelligence 70 (1-2):335-345.
The TSP phase transition.Ian P. Gent & Toby Walsh - 1996 - Artificial Intelligence 88 (1-2):349-358.

View all 11 citations / Add more citations

References found in this work

Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.
Easy problems are sometimes hard.Ian P. Gent & Toby Walsh - 1994 - Artificial Intelligence 70 (1-2):335-345.

Add more references