Non User
Index: >
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Business
Non User
Industries
Finance
Tax
Home
> DTIME
In
computational complexity theory
, the
complexity class
DTIME(f(n))
or
TIME(f(n))
is the set of
decision problem
s that can be solved by a
deterministic Turing machine
using time O(f(n)), and unlimited space.
The well-known complexity class
P
can be defined in terms of DTIME as follows:
Complexity classes
Non User
