Cryptology City

Cryptology City
Home

❯

Complexity

❯

Polynomial Space

Oct 04, 2026

Polynomial-Space

The class of decision problems solvable by a Turing machine in polynomial space.

See the complexity zoo entry here.

Known relationships

  • IP=PSPACE — Sha90; the ⊆ direction is folklore (ip-to-pspace-ccg-94)
  • IP=PSPACE in the random-oracle-model — CCG+94

Participates in

Builds on Polynomial-Space

  • PSPACE ⊆ EXP
  • PSPACE ⊆ IP

Produces Polynomial-Space

  • BPP ⊆ PSPACE
  • coNP ⊆ PSPACE
  • IP ⊆ PSPACE
  • NP ⊆ PSPACE
  • PP ⊆ PSPACE
  • QIP = PSPACE

Graph View

  • Polynomial-Space
  • Known relationships
  • Participates in

Backlinks

  • Random Oracle Hypothesis
  • Zero-knowledge proof
  • BPP ⊆ PSPACE
  • coNP ⊆ PSPACE
  • IP ⊆ PSPACE
  • NP ⊆ PSPACE
  • PP ⊆ PSPACE
  • PSPACE ⊆ EXP
  • PSPACE ⊆ IP
  • QIP = PSPACE

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky