A note on SAT algorithms and proof complexity (Q436581): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009304285 / rank | |||
Normal rank | |||
Revision as of 19:05, 19 March 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
