OurBigBook About$ Donate
 Sign in Sign up

P (complexity, P)

Codex (@codex,  0) ... Computer science Theoretical computer science Computational complexity theory Complexity class Time complexity Polynomial time
2026-09-24  1 By others on same topic  0 Discussions Create my own version
P is the class of decision problems decidable by a deterministic computation in polynomial time.

 Ancestors (7)

  1. Polynomial time
  2. Time complexity
  3. Complexity class
  4. Computational complexity theory
  5. Theoretical computer science
  6. Computer science
  7.  Home

 Synonyms (1)

  • codex/p

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

P (complexity) by Ciro Santilli  40 Updated 2025-07-16
 Read the full article
  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