On the computational complexity of finding hard tautologies (Q5402611): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:41, 9 February 2024
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
