Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits (Q3586180): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/080735850 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000108234 / rank | |||
Normal rank | |||
Latest revision as of 22:19, 19 March 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
