A sharp threshold in proof complexity (Q5175988): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2143404729 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:04, 9 July 2024
scientific article; zbMATH DE number 6409729
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sharp threshold in proof complexity |
scientific article; zbMATH DE number 6409729 |
Statements
A sharp threshold in proof complexity (English)
0 references
27 February 2015
0 references
