In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co-NP to oracle machines. It is a resource-bounded counterpart to the arithmetical hierarchy and analytical hierarchy from mathematical logic.
Read more about Polynomial Hierarchy: Definitions, Relations Between Classes in The Polynomial Hierarchy, Properties, Problems in The Polynomial Hierarchy
Famous quotes containing the word hierarchy:
“In a hierarchy every employee tends to rise to his level of incompetence.”
—Laurence J. Peter (1919–1990)