@InProceedings{blaser_et_al:LIPIcs.CCC.2021.29,
author = {Bl\"{a}ser, Markus and D\"{o}rfler, Julian and Ikenmeyer, Christian},
title = {{On the Complexity of Evaluating Highest Weight Vectors}},
booktitle = {36th Computational Complexity Conference (CCC 2021)},
pages = {29:1--29:36},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-193-1},
ISSN = {1868-8969},
year = {2021},
volume = {200},
editor = {Kabanets, Valentine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.29},
URN = {urn:nbn:de:0030-drops-143036},
doi = {10.4230/LIPIcs.CCC.2021.29},
annote = {Keywords: Algebraic complexity theory, geometric complexity theory, algebraic branching program, Waring rank, border Waring rank, representation theory, highest weight vector, treewidth}
}