Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3486680 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4280555761 / rank | |||
Normal rank | |||
Revision as of 19:38, 19 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
