E (complexity)
id:
e-complexity-289-13718435
title:
E (complexity)
text:
In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O(n) and is therefore equal to the complexity class DTIME(2O(n)). E, unlike the similar class EXPTIME, is not closed under polynomial-time many-one reductions.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/E_(complexity)
date created:
date modified:
2023-03-02T07:41:28Z
main entity:
{"identifier":"Q1276623","url":"https://www.wikidata.org/entity/Q1276623"}
image:
fields total:
13
integrity:
13