6 citations · 17 across the 13 of their papers we have counts for
Showing cs.CCShow all
2 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…
cs.CC2007
Geometry and the complexity of matrix multiplication
J. M. Landsberg
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose…