logoalt Hacker News

mjdv • today at 9:16 AM • 1 reply • view on HN

In fact it's even PSPACE-complete, which is (probably) much, much harder!


Replies

quibono • today at 9:43 AM

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).

➕ show 3 replies