ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:49, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION |
scientific article |
Statements
ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (English)
0 references
24 October 2011
0 references
proof complexity
0 references
Nisan-Wigderson generator
0 references
propositional proof system
0 references
reflection principle
0 references
propositional logic
0 references
disjunction property
0 references
