Cryptology City

Cryptology City
Home

❯

Complexity

❯

Polynomial Time

Aug 24, 2026

Polynomial-Time

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

See the complexity zoo entry here.

Known relationships

Participates in

Builds on Polynomial-Time

  • P ⊆ BPP
  • P ⊆ coNP
  • P ⊆ NP
  • poly
  • P ⊆ RP
  • P ⊆ ZPP

Graph View

  • Polynomial-Time
  • Known relationships
  • Participates in

Backlinks

  • Nondeterministic Polynomial-Time
  • P ⊆ BPP
  • P ⊆ coNP
  • P ⊆ NP
  • P ⊆ P/poly
  • P ⊆ RP
  • P ⊆ ZPP
  • Impagliazzo's Five Worlds

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky