A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A sharp threshold in proof complexity yields lower bounds for satisfiability search |
scientific article; zbMATH DE number 2117372
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sharp threshold in proof complexity yields lower bounds for satisfiability search |
scientific article; zbMATH DE number 2117372 |
Statements
A sharp threshold in proof complexity yields lower bounds for satisfiability search (English)
0 references
22 November 2004
0 references
0 references
