Problems in The Polynomial Hierarchy
- An example of a natural problem in is circuit minimization: given a number k and a circuit A computing a Boolean function f, determine if there is a circuit with at most k gates that computes the same function f. Let be the set of all boolean circuits. The language
- A complete problem for is satisfiability for quantified Boolean formulas with k alternations of quantifiers (abbreviated QBFk or QSATk). This is the version of the boolean satisfiability problem for . In this problem, we are given a Boolean formula f with variables partitioned into k sets X1, ..., Xk. We have to determine if it is true that
Read more about this topic: Polynomial Hierarchy
Famous quotes containing the words problems and/or hierarchy:
“Our young people are diseased with the theological problems of original sin, origin of evil, predestination, and the like. These never presented a practical difficulty to any man,never darkened across any mans road, who did not go out of his way to seek them. These are the souls mumps, and measles, and whooping- coughs, and those who have not caught them cannot describe their health or prescribe a cure. A simple mind will not know these enemies.”
—Ralph Waldo Emerson (18031882)
“In a hierarchy every employee tends to rise to his level of incompetence.”
—Laurence J. Peter (19191990)
Related Phrases
Related Words

