Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
E (complexity)
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
In [[computational complexity theory]], the [[complexity class]] '''E''' is the set of [[decision problem]]s that can be solved by a [[deterministic Turing machine]] in time 2<sup>[[Big O notation|O]](''n'')</sup> and is therefore equal to the complexity class [[DTIME]](2<sup>O(''n'')</sup>). '''E''', unlike the similar class [[EXPTIME]], is not closed under [[polynomial-time many-one reduction]]s.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)