The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (Q5902502)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5653734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies |
scientific article; zbMATH DE number 5653734 |
Statements
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (English)
0 references
6 January 2010
0 references
Boolean satisfiability
0 references
computational complexity
0 references
constraint satisfaction problem
0 references
dichotomy theorems
0 references
graph connectivity
0 references
graph of solutions
0 references
PSPACE-completeness
0 references
solution spaces of Boolean formulas
0 references
0.9999999
0 references
0 references
0 references
0.9585134
0 references
0.9142688
0 references
0.8914167
0 references
0.8883678
0 references
0.8883678
0 references
0.8802657
0 references
