NEXPTIME
id:
nexptime-198-1695823
title:
NEXPTIME
text:
In computational complexity theory, the complexity class NEXPTIME is the set of decision problems that can be solved by a non-deterministic Turing machine using time 2 n O . In terms of NTIME, Alternatively, NEXPTIME can be defined using deterministic Turing machines as verifiers. A language L is in NEXPTIME if and only if there exist polynomials p and q, and a deterministic Turing machine M, such that For all x and y, the machine M runs in time 2 p on input For all x in L, there exists a string
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/NEXPTIME
date created:
date modified:
2023-07-04T01:10:30Z
main entity:
{"identifier":"Q1575791","url":"https://www.wikidata.org/entity/Q1575791"}
image:
fields total:
13
integrity:
13