On the computational complexity of finding hard tautologies (Q5402611): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 20:21, 5 March 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
