NTIME

N1T1I1M3E1

noun

In computational complexity theory, the complexity class that is the set of decision problems that can be solved by a nondeterministic Turing machine which runs in time O(f(n)), where O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided).

Scrabble 7
Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

noun
  1. computerIn computational complexity theory, the complexity class that is the set of decision problems that can be solved by a nondeterministic Turing machine which runs in time O(f(n)), where O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided).
Cite this entry
APA

NTIME. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/NTIME

MLA

“NTIME.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/NTIME. Accessed November 3, 2026.

Chicago

WatkinsX Dictionary, s.v. “NTIME,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/NTIME.

Source: NTIME on Wiktionary, CC BY-SA 4.0.