Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793): Difference between revisions
From MaRDI portal
Set profile property. |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 06:06, 7 March 2024
scientific article; zbMATH DE number 7679915
Language | Label | Description | Also known as |
---|---|---|---|
English | Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes |
scientific article; zbMATH DE number 7679915 |
Statements
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (English)
0 references
27 April 2023
0 references
random \(k\)-SAT
0 references
cutting planes
0 references