Jump to content

Category:PSPACE-complete problems

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Gdr (talk | contribs) at 11:41, 8 May 2007 (←Created page with 'This category contains computational problems that have been proved to be PSPACE-complete. Category:Computational problems'). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

Pages in category "PSPACE-complete problems"

The following 17 pages are in this category, out of 17 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

T

True quantified Boolean formula

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

Computational problems