28 citations · 112 across the 18 of their papers we have counts for
Showing 2011 · cs.CCShow all
2 papers · 2 filters
cs.CC2011★ 28 cited
On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing
Michael A. Forbes, Amir Shpilka
We study the problem of obtaining efficient, deterministic, black-box polynomial identity testing algorithms for depth-3 set-multilinear circuits (over arbitrary fields). This clas…
cs.CC2011★ 22 cited
Tensor Rank: Some Lower and Upper Bounds
Boris Alexeev, Michael Forbes, Jacob Tsimerman
The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper…