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:
“I have said many times, and it is literally true, that there is absolutely nothing that could keep me in business, if my job were simply business to me. The human problems which I deal with every dayconcerning employees as well as customersare the problems that fascinate me, that seem important to me.”
—Hortense Odlum (1892?)
“In the world of the celebrity, the hierarchy of publicity has replaced the hierarchy of descent and even of great wealth.”
—C. Wright Mills (19161962)