Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Scott Diehl, Dieter van Melkebeek
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
ICALP, 2005.

ICALP 2005
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-2005-DiehlM,
	author        = "Scott Diehl and Dieter van Melkebeek",
	booktitle     = "{Proceedings of the 32nd International Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/11523468_79",
	isbn          = "3-540-27580-0",
	pages         = "982--993",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines}",
	volume        = 3580,
	year          = 2005,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.