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; zbMATH DE number 6059694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on SAT algorithms and proof complexity |
scientific article; zbMATH DE number 6059694 |
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
0.8132074475288391
0 references
0.7932993173599243
0 references
0.7860959768295288
0 references
