@inproceedings{B-The-Computational-Complexity-To-Evaluate-Representations-Of-General-Linear-Groups-1,
Title = {The computational complexity to evaluate representations of general linear groups},
Author = {Peter Bürgisser},
Booktitle = {In Proc. 10th International Conference on Formal Power Series and Algebraic Combinatorics},
Pages = {115-126},
Year = {1998},
Address = {Toronto},
Abstract = {We describe a fast algorithm to evaluate irreducible matrix representations of general linear groups $\mathrm{GL}(m,\mathbb C)$ with respect to a symmetry adapted basis (Gelfand-Tsetlin basis). This is complemented by a lower bound, which shows that our algorithm is optimal up to a factor $m^2$ with regard to nonscalar complexity. Our algorithm can be used for the fast evaluation of special functions: for instance, we obtain an $O(l \log l)$ algorithm to evaluate all associated Legendre functions of degree $l$. As a further application we obtain an algorithm to evaluate immanants, which is faster than previous algorithms due to Hartmann and Barvinok.},
Url = {http://www3.math.tu-berlin.de/algebra/work/rev-gl-exab.pdf},
Url2 = {http://epubs.siam.org/doi/abs/10.1137/S0097539798367892},
Reviewed = {True}
}