ConceptPSPACE完全 / PSPACE-完全
PSPACE-complete
A complexity class in computational complexity theory referring to decision problems that are solvable in polynomial space and are hard for all problems in PSPACE. PSPACE-complete problems are considered at least as difficult as NP-complete problems.
Timeline (last 90 days)
Sep 12
The Sokoban problem has been proven to be PSPACE-complete.
Unverified50%