An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (Q4930587): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_15 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1555583279 / rank | |||
Normal rank | |||
Latest revision as of 01:50, 20 March 2024
scientific article; zbMATH DE number 5793454
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
