In the

computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and explores the relationships between these classifications. A computational problem ...

, the low hierarchy and high hierarchy of complexity levels were introduced in 1983 by Uwe Schöning to describe the internal structure of the complexity class NP. The low hierarchy starts from complexity class P and grows "upwards", while the high hierarchy starts from class NP and grows "downwards". Later these hierarchies were extended to sets outside NP. The framework of high/low hierarchies makes sense only under the assumption that P is not NP. On the other hand, if the low hierarchy consists of at least two levels, then P is not NP.Lane A. Hemaspaandra, "Lowness: a yardstick for NP-P", ''ACM SIGACT News'', 1993, vol. 24, no.2, pp. 11-14. It is not known whether these hierarchies cover all NP.

References

Structural complexity theory {{comp-sci-theory-stub