An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q4930587)
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; zbMATH DE number 5793454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the Boolean connectivity problem for \(k\)-CNF |
scientific article; zbMATH DE number 5793454 |
Statements
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (English)
0 references
29 September 2010
0 references
0.9950430989265442
0 references
0.8202721476554871
0 references
0.7929829359054565
0 references
0.7913743853569031
0 references
0.7845054268836975
0 references
