Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654)
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 2117324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dual weak pigeonhole principle, Boolean complexity, and derandomization |
scientific article; zbMATH DE number 2117324 |
Statements
Dual weak pigeonhole principle, Boolean complexity, and derandomization (English)
0 references
22 November 2004
0 references
derandomization
0 references
weak pigeonhole principle
0 references
p-time functions
0 references
randomized algorithms
0 references
bounded arithmetic
0 references
circuit complexity
0 references
0 references
0.7977656126022339
0 references
0.7615540027618408
0 references
0.7501997947692871
0 references
0.7460390329360962
0 references
0.745020866394043
0 references
