Algebraic Branching Programs, Border Complexity, and Tangent Spaces

10 Mar 2020 Bläser Markus Ikenmeyer Christian Mahajan Meena Pandey Anurag Saurabh Nitin

Nisan showed in 1991 that the width of a smallest noncommutative single-(source,sink) algebraic branching program (ABP) to compute a noncommutative polynomial is given by the ranks of specific matrices. This means that the set of noncommutative polynomials with ABP width complexity at most $k$ is Zariski-closed, an important property in geometric complexity theory... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY