Stronger lower bounds and randomness-hardness trade-offs using associated algebraic complexity classes (Q2904790)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stronger lower bounds and randomness-hardness trade-offs using associated algebraic complexity classes |
scientific article; zbMATH DE number 6070930
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stronger lower bounds and randomness-hardness trade-offs using associated algebraic complexity classes |
scientific article; zbMATH DE number 6070930 |
Statements
23 August 2012
0 references
computational complexity
0 references
circuit lower bounds
0 references
polynomial identity testing
0 references
derandomization
0 references
Stronger lower bounds and randomness-hardness trade-offs using associated algebraic complexity classes (English)
0 references
