NEXPTIME
Description: A complexity class of decision problems solvable by a nondeterministic Turing machine in time bounded by an exponential function of input size.
Primary topic: Logic, Reasoning, and Knowledge (31%)
Wikidata ID: wiki/Q1575791
OpenAlex ID: keywords/nexptime
