PSPACE-completeness conjecture for sums of superstars
Statement
Let a sum of superstars be a disjunctive sum of impartial combinatorial games whose components are superstars, and let \ruleset{Paint Can} denote the corresponding game. PSPACE-completeness conjecture. A sum of superstars, and hence \ruleset{Paint Can}, is \cclass{PSPACE}-complete. The sum of superstars is already known to be \cclass{NP}-hard, while its precise complexity remains open; it is known to be solvable in polynomial space in the number of bits representing the sum.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.