ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5962798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION |
scientific article; zbMATH DE number 5962798 |
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
0 references
0 references
0.8491089
0 references
0.84184617
0 references
0.8366699
0 references
0.83399266
0 references
0.83310825
0 references
0.83310825
0 references
0.83103883
0 references
0.82845235
0 references
0.82845235
0 references
