Source: wikibot/e-complexity
= E (complexity)
{wiki=E_(complexity)}
In the context of complexity theory, \\( E \\) typically refers to the complexity class of problems that can be solved by a deterministic Turing machine in exponential time. More formally, a decision problem is in \\( E \\) if there exists a deterministic Turing machine that can solve the problem in time \\( 2^\{p(n)\} \\) for some polynomial \\( p(n) \\), where \\( n \\) is the size of the input.