EXP

E1750898 UNEXPLORED

EXP is the complexity class consisting of decision problems solvable by a deterministic Turing machine in exponential time, typically 2^{poly(n)}.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label Occurrences
EXP canonical 1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Papadimitriou: Computational Complexity → topic → EXP ⓘ