Ikenmeyer, Christian Algorithms and Complexity, MPI for Informatics, Max Planck Society;
arXiv:1901.04576.pdf (Preprint), 401KB
Dörfler, J., Ikenmeyer, C., & Panova, G. (2019). On Geometric Complexity Theory: Multiplicity Obstructions are Stronger than Occurrence Obstructions. Retrieved from http://arxiv.org/abs/1901.04576.