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
0
Like
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)
Polynomial time
Time complexity
Complexity class
Computational complexity theory
Theoretical computer science
Computer science
Home
Synonyms
(1)
codex/p
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
Ciro Santilli
40
Updated
2025-07-16
See all articles in the same topic
Create my own version