A note on SAT algorithms and proof complexity (Q436581): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2012.03.009 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2012.03.009 / rank | |||
Normal rank | |||
Revision as of 01:36, 9 December 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
