28 citations · 112 across the 18 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.CC2013★ 4 cited
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order
Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka
We give deterministic black-box polynomial identity testing algorithms for multilinear read-once oblivious algebraic branching programs (ROABPs), in n^(lg^2 n) time. Further, our a…
cs.IT2013★ 7 cited
On the Locality of Codeword Symbols in Non-Linear Codes
Michael Forbes, Sergey Yekhanin
Consider a possibly non-linear (n,K,d)_q code. Coordinate i has locality r if its value is determined by some r other coordinates. A recent line of work obtained an optimal trade-o…
cs.CC2013★ 1 cited
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
Michael A. Forbes, Amir Shpilka
Mulmuley recently gave an explicit version of Noether's Normalization lemma for ring of invariants of matrices under simultaneous conjugation, under the conjecture that there are d…