Improved Lower Bounds on the Randomized Complexity of Graph Properties
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

Amit Chakrabarti, Subhash Khot
Improved Lower Bounds on the Randomized Complexity of Graph Properties
ICALP, 2001.

ICALP 2001
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-2001-ChakrabartiK,
	author        = "Amit Chakrabarti and Subhash Khot",
	booktitle     = "{Proceedings of the 28th International Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/3-540-48224-5_24",
	isbn          = "3-540-42287-0",
	pages         = "285--296",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Improved Lower Bounds on the Randomized Complexity of Graph Properties}",
	volume        = 2076,
	year          = 2001,
}

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.