by Harald Hempel
Preprint series: 99-29, Reports on Computer Science
We show that the order in which different-size-rounds of parallel
queries to oracles from the polynomial hierarchy are made never
matters. This solves a problem left open by previous papers in that
Our results shed new light on the number-of-queries tradeoffs between
parallel, a mixture of parallel and sequential, and pure sequential
access to oracles from the polynomial hierarchy.