In fact it's even PSPACE-complete, which is (probably) much, much harder!
I've always struggled to understand what the difference is. Is PSPACE-completeness "worse" in a practical sense?
I'm assuming P != NP (and NP != PSPACE).
I've always struggled to understand what the difference is. Is PSPACE-completeness "worse" in a practical sense?
I'm assuming P != NP (and NP != PSPACE).