Go to the corresponding Portal 
Diehl, Scott ; van Melkebeek, Dieter
pdfformat: 

@InProceedings{diehl_et_al:DSP:2006:605, author = {Scott Diehl and Dieter van Melkebeek}, title = {TimeSpace Lower Bounds for the PolynomialTime Hierarchy on Randomized Machines}, booktitle = {Complexity of Boolean Functions}, year = {2006}, editor = {Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek}, number = {06111}, series = {Dagstuhl Seminar Proceedings}, ISSN = {18624405}, publisher = {Internationales Begegnungs und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2006/605}, annote = {Keywords: Timespace lower bounds, lower bounds, randomness, polynomialtime hierarchy} }
Keywords:  Timespace lower bounds, lower bounds, randomness, polynomialtime hierarchy  
Seminar:  06111  Complexity of Boolean Functions  
Issue Date:  2006  
Date of publication:  09.10.2006 