Home
Random
Log in
Settings
Donations
About Wiktionary
Disclaimers
Search
NEXPTIME
Language
Watch
Edit
English
edit
Noun
edit
NEXPTIME
(
computer science
)
In
computational complexity theory
, a
complexity class
in which the set of
decision problems
can be solved by a
nondeterministic Turing machine
using time
2
n
O
(
1
)
{\displaystyle 2^{n^{O(1)}}}
.
.