Lower bounds for cutting planes proofs with small coefficients (Q4372903): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The monotone circuit complexity of Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The intractability of resolution / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of cutting-plane proofs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Provability of the pigeonhole principle and the existence of infinitely many primes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The relative efficiency of propositional proof systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank | |||
Normal rank | |||
Latest revision as of 08:59, 28 May 2024
scientific article; zbMATH DE number 1097731
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for cutting planes proofs with small coefficients |
scientific article; zbMATH DE number 1097731 |
Statements
Lower bounds for cutting planes proofs with small coefficients (English)
0 references
2 February 1998
0 references
tree-like proofs
0 references
Frege proofs
0 references
small-weight cutting planes proofs
0 references
Resolution
0 references
