On the computational complexity of finding hard tautologies (Q5402611)
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: On the computational complexity of finding hard tautologies |
scientific article; zbMATH DE number 6270262
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of finding hard tautologies |
scientific article; zbMATH DE number 6270262 |
Statements
On the computational complexity of finding hard tautologies (English)
0 references
14 March 2014
0 references
propositional proof systems
0 references
proof complexity
0 references
Nisan-Wigderson generator
0 references
