摘要：Hemaspaandra, Hempel, and Wechsung [HHW] 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. denotes the class of languages computable by a polynomial-time machine that is allowed one query to followed by one query to [HHW]. 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.
