Positivity of the Symmetric Group Characters Is as Hard as the Polynomial Time Hierarchy

von Ikenmeyer, Christian
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 5 of 7 (2023)

On the Orbit Closure Containment Problem and Slice Rank of Tensors

von Bläser, Markus
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 4 of 4 (2021)