Treffer: THE RESOLUTION COMPLEXITY OF RANDOM CONSTRAINT SATISFACTION PROBLEMS
Title:
THE RESOLUTION COMPLEXITY OF RANDOM CONSTRAINT SATISFACTION PROBLEMS
Authors:
Source:
SIAM journal on computing (Print). 37(3):895-922
Publisher Information:
Philadelphia, PA: Society for Industrial and Applied Mathematics, 2008.
Publication Year:
2008
Physical Description:
print, 40 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Divers, Miscellaneous, Complexité, Complexity, Complejidad, Contrainte, Constraint, Coacción, Polynôme, Polynomial, Polinomio, Résolution, Resolution, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Seuil, Threshold, Umbral, Problème satisfaction contrainte, Restriction, 03F20, 60C05, 68Q25, 68R05, phase transition, random constraint satisfaction problems, random k-SAT, resolution complexity, sharp threshold
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, University of Toronto, Toronto, ON, M4E 3G1, Canada
Department of Computing Science, University of Alberta, Edmonton, AB, T6G 2E8, Canada
Department of Computing Science, University of Alberta, Edmonton, AB, T6G 2E8, Canada
ISSN:
0097-5397
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.20390414
Database:
PASCAL Archive
Weitere Informationen
We consider random instances of constraint satisfaction problems where each variable has domain size d and each constraint contains t restrictions on k variables. For each (d, k, t) we determine whether the resolution complexity is a.s. constant, polynomial, or exponential in the number of variables. For a particular range of (d, k, t), we determine a sharp threshold for resolution complexity where the resolution complexity drops from a.s. exponential to a.s. polynomial when the clause density passes a specific value.