OurBigBook About$ Donate
 Sign in+ Sign up
by Ciro Santilli (@cirosantilli, 37)

P (complexity, Polynomial time)

 ... Computational problem Complexity class ELEMENTARY (complexity) EXPTIME PSPACE NP (complexity)
 0 By others on same topic  0 Discussions  Updated 2025-05-13  +Created 1970-01-01  See my version
  • Table of contents
    • NC (complexity) P (complexity)
    • Polynomial time algorithm P (complexity)

NC (complexity, Efficiently parallelizable)

 0  0 
P (complexity)

Polynomial time algorithm

 0  0 
P (complexity)

 Tagged

  • Schoof's algorithm

 Ancestors (12)

  1. NP (complexity)
  2. PSPACE
  3. EXPTIME
  4. ELEMENTARY (complexity)
  5. Complexity class
  6. Computational problem
  7. Computer science
  8. Computer
  9. Information technology
  10. Area of technology
  11. Technology
  12.  Home

 Incoming links (6)

  • BQP
  • Diffie-Hellman key exchange
  • Integer factorization
  • NP-intermediate
  • P versus NP problem
  • RSA (cryptosystem)

 Synonyms (1)

  • cirosantilli/polynomial-time

 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