NEXPTIME
NEXPTIME noun: 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ᴼ⁽¹⁾).
Noun
NEXPTIME
- 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ᴼ⁽¹⁾).
Questions about NEXPTIME
- What does NEXPTIME mean?
- NEXPTIME means 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ᴼ⁽¹⁾).
- What part of speech is NEXPTIME?
- NEXPTIME is a noun.
Words near NEXPTIME in the dictionary
Source and license
Adapted from Wiktionary: NEXPTIME (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “NEXPTIME.” Word.ws, https://word.ws/nexptime. Based on Wiktionary, CC BY-SA 4.0.
