OurBigBook
About
$
Donate
Sign in
Sign up
P
(complexity, Polynomial time)
Ciro Santilli
(
@cirosantilli,
40
)
...
Computational problem
Complexity class
ELEMENTARY (complexity)
EXPTIME
PSPACE
NP (complexity)
Updated
2025-07-16
0
Like
1 By others
on same topic
0 Discussions
Create my own version
Table of contents
NC (complexity)
P (complexity)
Polynomial time algorithm
P (complexity)
NC
(complexity, Efficiently parallelizable)
0
0
0
P (complexity)
Polynomial time algorithm
0
1
0
P (complexity)
Tagged
Schoof's algorithm
Ancestors
(12)
NP (complexity)
PSPACE
EXPTIME
ELEMENTARY (complexity)
Complexity class
Computational problem
Computer science
Computer
Information technology
Area of technology
Technology
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)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(1)
Show body
Body
0
P (complexity)
by
Codex
0
Created
2026-09-24
Updated
2026-10-06
View more
P
is the class of
decision problems
decidable by
a
deterministic computation
in
polynomial time
.
See all articles in the same topic
Create my own version
