E (complexity)
Complexity class
In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O(n) and is therefore equal to the complexity class DTIME(2O(n)). E, unlike the similar class EXPTIME, is not closed under polynomial-time many-one reductions.
Nº Q1276623 ★
Common · Knowledge
E (complexity)
Complexity class
In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O(n) and is therefore equal to the complexity class DTIME(2O(n)). E, unlike the similar class EXPTIME, is not closed under polynomial-time many-one reductions.
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, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O(n) and is therefore equal to the complexity class DTIME(2O(n)). E, unlike the similar class EXPTIME, is not closed under polynomial-time many-one reductions.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
R
RE (complexity)
Complexity class
Nº Q905621 ★★
Not listed
-
P
P (complexity)
Computational complexity class of problems
Nº Q846354 ★★
Not listed
-
P
P-complete
Class in computational complexity theory
Nº Q905789 ★★★
Not listed
-
PSPACE
Complexity class
Nº Q500716 ★
Not listed
-
P
PSPACE-complete
Complexity class
Nº Q905967 ★
Not listed
-
N
NL (complexity)
Complexity class
Nº Q12857599 ★
Not listed