The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QuteSAT / rank | |||
Normal rank | |||
Revision as of 01:01, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The connectivity of Boolean satisfiability: dichotomies for formulas and circuits |
scientific article |
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
