Jump to content

Category:PSPACE-complete problems

From Wikipedia, the free encyclopedia

This category contains computational problems that have been proved to be PSPACE-complete.

Pages in category "PSPACE-complete problems"

The following 18 pages are in this category, out of 18 total. This list may not reflect recent changes.

List of PSPACE-complete problems

A

C

E

Emptiness problem

F

Formula game

G

H

Hex (board game)

I

Intersection non-emptiness problem

N

R

S

Sokoban

T

True quantified Boolean formula

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:PSPACE-complete_problems&oldid=129213255"

Computational problems