A note on SAT algorithms and proof complexity (Q436581): Difference between revisions
From MaRDI portal
Revision as of 11:36, 5 July 2024
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