A note on SAT algorithms and proof complexity (Q436581)
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: A note on SAT algorithms and proof complexity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on SAT algorithms and proof complexity |
scientific article |
Statements
A note on SAT algorithms and proof complexity (English)
0 references
25 July 2012
0 references
computational complexity
0 references
SAT algorithms
0 references
0 references
0 references
