arXiv · cs/9910005
Query Order and the Polynomial Hierarchy
Abstract
Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is affected by the order in which information sources are accessed. The present paper studies, for the first time, query order as it applies to the levels of the polynomial hierarchy. We prove that the levels of the polynomial hierarchy are order-oblivious. Yet, we also show that these ordered query classes form new levels in the polynomial hierarchy unless the polynomial hierarchy collapses. We prove that all leaf language classes - and thus essentially all standard complexity classes - inherit all order-obliviousness results that hold for P.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel. 1999-10-04. Query Order and the Polynomial Hierarchy. https://searcharxiv.com/abs/cs/9910005
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.