6 citations · 17 across the 13 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.CC2009★ 4 cited
Holographic algorithms without matchgates
J. M. Landsberg, Jason Morton, Serguei Norine
The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, yields insight into the hierarchy of complexity classes. In…
math.AG2009
Kruskal's theorem
J. M. Landsberg
This is just a short proof of Kruskal's theorem regarding uniqueness of expressions for tensors, phrased in geometric language.
math.AG2009★ 6 cited
On the ranks and border ranks of symmetric tensors
J. M. Landsberg, Zach Teitler
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We…