A computational trichotomy for connectivity of Boolean satisfiability (Q3194807)
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 6496943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational trichotomy for connectivity of Boolean satisfiability |
scientific article; zbMATH DE number 6496943 |
Statements
20 October 2015
0 references
Boolean satisfiability
0 references
Boolean CSPs
0 references
computational complexity
0 references
PSPACE-completeness
0 references
dichotomy theorems
0 references
graph connectivity
0 references
0.917072594165802
0 references
0.8998255133628845
0 references
0.8904021978378296
0 references
0.8875468373298645
0 references
0.8546323776245117
0 references
