During the past decade, nine papers have obtained increasingly strong consequences from the assumption that boolean or bounded-query hierarchies collapse. The final four papers of this nine-paper progression actually achieve downward collapse---that is, they show that high-level collapses induce collapses at (what before-the-fact seemed to be) lower complexity levels. For example, for each k ≥ 2 it. is now known that if one query to σ p k is as powerful as two queries to σ p k (i.e., P Σ1 = P Σ2 ), then PH = σ p k . This article surveys the history, the results, and the method---the so-called easy-hard technique---of the just-mentioned nine-paper progression:1. J. Kadin. The polynomial time hierarchy collapses if the boolean hierarchy collapses. SIAM Journal on Computing , 17(6):1263--1282, 1988. Erratum appears in the same journal. 20(2):404.2. K. Wagner. Number-of-query hierarchies. Technical Report 158, Institut für Mathematik. Universität Augsburg, Augsburg, Germany, October 1987.3. K. Wagner. Number-of-query hierarchies. Technical Report 4. Institut für Informatik. Universität Würzburg, Würzburg, Germany, February 1989.4. R. Chang and J. Kadin. The boolean hierarchy and the polynomial hierarchy: A closer connection. SIAM Journal on Computing . 25(2):340--354. 1996.5. R. Beigel. R. Chang. and M. Ogiwara. A relationship between difference hierarchies and relativized polynomial hierarchies. Mathematical Systems Theory . 26(3):293--310, 1993.6. E. Hemaspaandra, L. Hemaspaandra. and H. Hempel. An upward separation in the polynomial hierarchy. Technical Report Math/Inf/96/15, Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany, June 1996.7. E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. A downward collapse within the polynomial hierarchy. SIAM Journal on Computing , 28(2):383--393, 1999.8. H. Buhrman and L. Fortnow. Two queries. In Proceedings of the 13th Annual IEEE Conference on Computational Complexity . 13--19. IEEE Computer Society Press, June 1998.9. E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. Translating equality downwards. Technical Report TR-657. Department of Computer Science, University of Rochester, Rochester, NY. April 1997.
End of preview. The entire article is 13 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/what-s-up-with-downward-collapse-using-the-easy-hard-technique-to-link-AvAtyH1Zx0
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
Follow ACM SIGACT News
, Volume 29 (3)
Association for Computing Machinery – Sep 1, 1998
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
