NEXPTIME

释义与例句

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

    计算机 工程 数学