62 citations · 222 across the 34 of their papers we have counts for
3 papers · 1 filter
Algebraic Branching Programs, Border Complexity, and Tangent Spaces
Markus Bläser, Christian Ikenmeyer, Meena Mahajan +2
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…
The Computational Complexity of Plethysm Coefficients
Nick Fischer, Christian Ikenmeyer
In two papers, Bürgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) t…
On the complexity of evaluating highest weight vectors
Markus Bläser, Julian Dörfler, Christian Ikenmeyer
Geometric complexity theory (GCT) is an approach towards separating algebraic complexity classes through algebraic geometry and representation theory. Originally Mulmuley and Sohon…