Identity testing and lower bounds for read-\(k\) oblivious algebraic branching programs (Q5368764)
From MaRDI portal
!
WARNING
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 6789295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identity testing and lower bounds for read-\(k\) oblivious algebraic branching programs |
scientific article; zbMATH DE number 6789295 |
Statements
10 October 2017
0 references
algebraic complexity
0 references
lower bounds
0 references
derandomization
0 references
polynomial identity testing
0 references
Identity testing and lower bounds for read- k oblivious algebraic branching programs (English)
0 references
0.99753338098526
0 references
0.8199496865272522
0 references
0.8170631527900696
0 references
0.815682590007782
0 references
0.8122888207435608
0 references
