2-EXPTIME
id:
2-exptime-314-11335579
title:
2-EXPTIME
text:
In computational complexity theory, the complexity class 2-EXPTIME (sometimes called 2-EXP) is the set of all decision problems solvable by a deterministic Turing machine in O(22p(n)) time, where p(n) is a polynomial function of n. In terms of DTIME, We know 2-EXPTIME can also be reformulated as the space class AEXPSPACE, the problems that can be solved by an alternating Turing machine in exponential space. This is one way to see that EXPSPACE ⊆ 2-EXPTIME, since an alternating Turing machine is
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/2-EXPTIME
date created:
date modified:
2023-07-22T23:19:41Z
main entity:
{"identifier":"Q10844267","url":"https://www.wikidata.org/entity/Q10844267"}
image:
fields total:
13
integrity:
13