Nexptime

noun

noun ·Rare ·Advanced level

Definitions

Noun
  1. 1
    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ᴼ⁽¹⁾).

Data sourced from Wiktionary, WordNet, CMU, and other open linguistic databases. Updated March 2026.