In computational complexity theory, the exponential hierarchy is a hierarchy of complexity classes that is an exponential time analogue of the polynomial hierarchy. As elsewhere in complexity theory, “exponential” is used with two different meanings (linear exponential bounds 2 c n {\displaystyle 2^{cn}} for a constant c, and full exponential bounds 2 n c {\displaystyle 2^{n^{c}}} ), leading to two versions of the exponential hierarchy.
In computational complexity theory, the exponential hierarchy is a hierarchy of complexity classes that is an exponential time analogue of the polynomial hierarchy. As elsewhere in complexity theory, “exponential” is used with two different meanings (linear exponential bounds 2 c n {\displaystyle 2^{cn}} for a constant c, and full exponential bounds 2 n c {\displaystyle 2^{n^{c}}} ), leading to two versions of the exponential hierarchy.
Source: Wikipedia "Exponential hierarchy" · CC BY-SA 4.0
Share this article: X · Bluesky