An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact algorithm for the Boolean connectivity problem for \(k\)-CNF |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for the Boolean connectivity problem for \(k\)-CNF |
scientific article |
Statements
An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (English)
0 references
12 September 2011
0 references
exponential-time algorithms
0 references
Boolean connectivity
0 references
CNF satisfiability
0 references
