The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics, and threshold phenomena. Recent work on heuristics and the satisfiability threshold has centered around the structure and connectivity of the solution space. Motivated by this work, we...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on computing Vol. 38; no. 6; pp. 2330 - 2355
Main Authors:	Gopalan, Parikshit, Kolaitis, Phokion G., Maneva, Elitza, Papadimitriou, Christos H.
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2009
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Boolean Cloning Computer engineering Computer science Computer science; control theory; systems Connectivity Exact sciences and technology Graphs Information retrieval. Graph Mathematical analysis Mathematics Miscellaneous Ordinary differential equations Sciences and techniques of general use Theoretical computing Polynomial 68Q15 68Q25 Heuristic algorithm Heuristics 68Q17 PSPACE-completeness 05C40 Benchmarks PSPACE Boolean satisfiability Polynomial time dichotomy theorems Dichotomy Graph connectivity Algorithm complexity Hypercube Subgraph 03D15 Satisfiability problem Threshold computational complexity
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!