Scott Diehl, Dieter van Melkebeek. Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. In Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek, editors, Complexity of Boolean Functions, 12.03. - 17.03.2006. Volume 06111 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. [doi]
@inproceedings{DiehlM06:0,
title = {Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines},
author = {Scott Diehl and Dieter van Melkebeek},
year = {2006},
url = {http://drops.dagstuhl.de/opus/volltexte/2006/605},
researchr = {https://researchr.org/publication/DiehlM06%3A0},
cites = {0},
citedby = {0},
booktitle = {Complexity of Boolean Functions, 12.03. - 17.03.2006},
editor = {Matthias Krause and Pavel Pudlák and Rüdiger Reischuk and Dieter van Melkebeek},
volume = {06111},
series = {Dagstuhl Seminar Proceedings},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany},
}