Category:PSPACE-complete problems

From Wikipedia, the free encyclopedia

Jump to navigation Jump to search

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

Script error: No such module "anchor".Pages in category "PSPACE-complete problems"

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

List of PSPACE-complete problems

A

C

Canadian traveller problem

F

Formula game

G

H

Hex (board game)

R

T

True quantified Boolean formula

Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=Category:PSPACE-complete_problems&oldid=4650829"

Computational problems