Go to the corresponding LIPIcs Volume Portal 
Bläser, Markus ; Dörfler, Julian ; Ikenmeyer, Christian
pdfformat: 

@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:129:36}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771931}, ISSN = {18688969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14303}, URN = {urn:nbn:de:0030drops143036}, 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} }
Keywords:  Algebraic complexity theory, geometric complexity theory, algebraic branching program, Waring rank, border Waring rank, representation theory, highest weight vector, treewidth  
Collection:  36th Computational Complexity Conference (CCC 2021)  
Issue Date:  2021  
Date of publication:  08.07.2021 