Complexity of propositional proofs under a promise (Q2946606)
From MaRDI portal
(Redirected from Item:Q5428817)
 | 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: Complexity of propositional proofs under a promise |
scientific article; zbMATH DE number 5215575
- Complexity of Propositional Proofs Under a Promise
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of propositional proofs under a promise |
scientific article; zbMATH DE number 5215575 |
|
Statements
Complexity of propositional proofs under a promise (English)
0 references
Complexity of Propositional Proofs Under a Promise (English)
0 references
17 September 2015
0 references
28 November 2007
0 references
promise problems
0 references
propositional proof complexity
0 references
random 3CNF
0 references
resolution
0 references
proof complexity
0 references
0 references
0.94456315
0 references
0.94456315
0 references
0 references
0 references
