The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031)
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 6793997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The connectivity of Boolean satisfiability: dichotomies for formulas and circuits |
scientific article; zbMATH DE number 6793997 |
Statements
The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (English)
0 references
20 October 2017
0 references
Boolean satisfiability
0 references
Boolean circuits
0 references
Post's lattice
0 references
PSPACE-completeness
0 references
dichotomy theorems
0 references
graph connectivity
0 references
0 references
1.0000002
0 references
0 references
0 references
0.93505585
0 references
0.89916843
0 references
0.8894641
0 references
0.8835183
0 references
0.8827125
0 references
0.8813678
0 references
0.8813678
0 references
