Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 23:59, 5 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
