The polynomial time hierarchy collapses if the Boolean hierarchy collapses
Jim Kadin
Abstract
Jim Kadin
Abstract
It is shown that if the Boolean hierarchy (BH) collapses, then there exists a sparse set S such that co-NP contained in NP/sup S/, and therefore the polynomial-time hierarchy (PH) collapses to a subclass of Delta P/3. Since the BH is contained in P/sup NP/, these results relate the internal structure of P/sup NP/ to the structure of the PH as a whole. Other conditions that imply the collapse of the BH (and the collapse of the PH in turn) are examined.>
OpenAlex reports 21 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is shown that if the Boolean hierarchy (BH) collapses, then there exists a sparse set S such that co-NP contained in NP/sup S/, and therefore the polynomial-time hierarchy (PH) collapses to a subclass of Delta P/3. Since the BH is contained in P/sup NP/, these results relate the internal structure of P/sup NP/ to the structure of the PH as a whole. Other conditions that imply the collapse of the BH (and the collapse of the PH in turn) are examined.>
Key concepts: Hierarchy, Polynomial hierarchy, Combinatorics, Time complexity, Mathematics, Set (abstract data type), Boolean data type, Polynomial