The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
نویسندگان
چکیده
منابع مشابه
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the k th level of the Boolean hierarchy over Σ2 . This is an improvement over the known results [3], which show that the polynomial hierarchy would collapse to P [O(log . This result is significant in two ways. First, the theorem says that a deeper collapse of the Boole...
متن کاملThe Polynomial Hierarchy, Random Oracles, and Boolean Circuits∗
We give an overview of a recent result [RST15] showing that the polynomial hierarchy is infinite relative to a random oracle. Since the early 1980s it has been known that this result would follow from a certain “average-case depth hierarchy theorem” for Boolean circuits. In this article we present some background and history of related relativized separations; sketch the argument showing how th...
متن کاملThe Promise Polynomial Hierarchy
The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to include promise problems. It turns out that the promise polynomial hierarchy is considerably simpler to work with, and many open questions about the polynomial hierarchy can be resolved in the promise polynomial hierarc...
متن کاملBPP and the Polynomial Hierarchy
We start with some definitions about probabilistic Turing machines (for a detailed exposition of this subject the reader is referred to [2]). Our basic model of computation is the Turing machine with input alphabet S z (0, l}. All machines are assumed to have two terminal states, namely q0 (reject) and 9, (accept). A probabilistic Turing machine (PTM) is syntactically the same as a nondetermini...
متن کاملPolynomial-Length Planning Spans the Polynomial Hierarchy
This paper presents a family of results on the computational complexity of the decision problem associated with planning: Does a valid plan exist? We consider the effect on complexity of several assumptions typical of classical planning: complete knowledge of the initial state, determinism, polynomial-time determination of executability of actions in a state. We consider plans of two types: con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1996
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539790178069