On the structure of solution-graphs for Boolean formulas (Q2947874)
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 6486802
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the structure of solution-graphs for Boolean formulas |
scientific article; zbMATH DE number 6486802 |
Statements
On the Structure of Solution-Graphs for Boolean Formulas (English)
0 references
29 September 2015
0 references
partial cube
0 references
succinct
0 references
embedding
0 references
\(st\)-connectivity
0 references
connectivity
0 references
satisfiability
0 references
0.8959294557571411
0 references
0.8902055621147156
0 references
0.8276404738426208
0 references
0.8219497799873352
0 references
0.8195374011993408
0 references
