Hardness-randomness tradeoffs for bounded depth arithmetic circuits (Q3586180)
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 5779422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness-randomness tradeoffs for bounded depth arithmetic circuits |
scientific article; zbMATH DE number 5779422 |
Statements
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits (English)
0 references
6 September 2010
0 references
polynomial identity testing
0 references
derandomization
0 references
polynomial factoring
0 references
hardness
0 references
randomness
0 references
0.860526442527771
0 references
0.8599673509597778
0 references
0.8404887914657593
0 references
