Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines.
S. Diehl, and D. van Melkebeek. Complexity of Boolean Functions, volume 06111 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)