Exponential hierarchy

In computational complexity theory, the exponential hierarchy is a hierarchy of complexity classes, which is an exponential time analogue of the polynomial hierarchy. As elsewhere in complexity theory, “exponential” is used in two different meanings (linear exponential bounds for a constant c, and full exponential bounds ), leading to two versions of the exponential hierarchy: * EH is the union of the classes for all k, where (i.e., languages computable in nondeterministic time for some constant c with a oracle). One also defines , . An equivalent definition is that a language L is in where , where ,

Exponential hierarchy

In computational complexity theory, the exponential hierarchy is a hierarchy of complexity classes, which is an exponential time analogue of the polynomial hierarchy. As elsewhere in complexity theory, “exponential” is used in two different meanings (linear exponential bounds for a constant c, and full exponential bounds ), leading to two versions of the exponential hierarchy: * EH is the union of the classes for all k, where (i.e., languages computable in nondeterministic time for some constant c with a oracle). One also defines , . An equivalent definition is that a language L is in where , where ,