OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

List of PSPACE-complete problems

 Home Mathematics History of mathematics Mathematical problems Computational problems PSPACE-complete problems
 0 By others on same topic  0 Discussions  1970-01-01  See my version
PSPACE-complete problems are decision problems that are both in PSPACE (problems solvable in polynomial space) and as hard as any problem in PSPACE. This means that if any PSPACE-complete problem can be solved in polynomial time, then every problem in PSPACE can also be solved in polynomial time, implying that PSPACE = P.

 Ancestors (6)

  1. PSPACE-complete problems
  2. Computational problems
  3. Mathematical problems
  4. History of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook