English PSPACE-complete Cited by user David Eppstein on 26 Sep 2021 In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input length (polynomial…