@InProceedings{burke_et_al:LIPIcs.FUN.2024.8, author = {Burke, Kyle and Ferland, Matthew and Huntemann, Svenja and Teng, Shanghua}, title = {{A Tractability Gap Beyond Nim-Sums: It’s Hard to Tell Whether a Bunch of Superstars Are Losers}}, booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-314-0}, ISSN = {1868-8969}, year = {2024}, volume = {291}, editor = {Broder, Andrei Z. and Tamir, Tami}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.8}, URN = {urn:nbn:de:0030-drops-199168}, doi = {10.4230/LIPIcs.FUN.2024.8}, annote = {Keywords: Combinatorial Game Theory, NP-hardness, Superstars} }