Result: Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Title:
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Authors:
Source:
Typical case complexity and phase transitionsDiscrete applied mathematics. 153(1-3):89-123
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2005.
Publication Year:
2005
Physical Description:
print, 74 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, 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, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Informatique théorique, Computer theory, Informática teórica, Seuil, Threshold, Umbral, Analyse probabiliste, Probabilistic analysis, CNF, Satisfiabilité, k CNF, Satisfiability, k-CNF
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
ECECS, University of Cincinnati, Cincinnati, OH 45221-0030, United States
ISSN:
0166-218X
Rights:
Copyright 2006 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.17350529
Database:
PASCAL Archive
Further Information
This is a written record of a survey talk on the topic of typical case complexity of Satisfiability algorithms which was presented at the LICS workshop on this subject in June, 2003, Ottawa, Canada.