On the relative complexity of resolution refinements and cutting planes proof systems (Q2706120)
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: On the relative complexity of resolution refinements and cutting planes proof systems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the relative complexity of resolution refinements and cutting planes proof systems |
scientific article |
Statements
19 March 2001
0 references
resolution
0 references
cutting planes proof system
0 references
computational complexity
0 references
proof complexity
0 references
circuit complexity
0 references
On the relative complexity of resolution refinements and cutting planes proof systems (English)
0 references
