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 the normal view instead:
scientific article; zbMATH DE number 6070930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8404887914657593
0 references
0.8392537832260132
0 references
0.8266115784645081
0 references
