Cryptology City

Cryptology City
Home

❯

Complexity

❯

Polynomial Space

Aug 24, 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
  • IP=PSPACE in the random-oracle-model — CCG+94

Participates in

Builds on Polynomial-Space

  • PSPACE ⊆ EXP

Produces Polynomial-Space

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

Graph View

  • Polynomial-Space
  • Known relationships
  • Participates in

Backlinks

  • No relativizing reduction from ROM to ROH
  • Computational zero-knowledge
  • Zero-knowledge proof
  • BPP ⊆ PSPACE
  • coNP ⊆ PSPACE
  • CZK = IP
  • IP ⊆ PSPACE
  • IP ⊆ SZK
  • NP ⊆ PSPACE
  • PP ⊆ PSPACE
  • PSPACE ⊆ EXP
  • QIP = PSPACE

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky