Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits (Q3586180): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:06, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits |
scientific article |
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
