P (complexity)
Computational complexity class of problems
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time.
Nº Q846354 ★★
Uncommon · Knowledge
P (complexity)
Computational complexity class of problems
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time. Cobham's thesis holds that P is the class of computational problems that are "efficiently solvable" or "tractable". This is inexact: in practice, some problems not known to be in P have practical solutions, and some that are in P do not, but this is a useful rule of thumb.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
P-complete
Class in computational complexity theory
Nº Q905789 ★★★
PSPACE
Complexity class
Nº Q500716 ★
♯P
Set of the counting problems associated with the decision problems in the set NP
Nº Q1322138 ★
NP-hardness
Complexity class
Nº Q1137554 ★★
NP (complexity)
Computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time
Nº Q628036 ★★★
NC (complexity)
Complexity class
Nº Q1141840 ★