On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems (Q2706120): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems |
scientific article |
Statements
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems (English)
0 references
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
