Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms (Q3434543)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms |
scientific article |
Statements
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms (English)
0 references
2 May 2007
0 references
