An optimal lower bound on the communication complexity of gap-hamming-distance
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, Oded Regev
An optimal lower bound on the communication complexity of gap-hamming-distance
STOC, 2011.

STOC 2011
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2011-ChakrabartiR,
	author        = "Amit Chakrabarti and Oded Regev",
	booktitle     = "{Proceedings of the 43rd Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/1993636.1993644",
	isbn          = "978-1-4503-0691-1",
	pages         = "51--60",
	publisher     = "{ACM}",
	title         = "{An optimal lower bound on the communication complexity of gap-hamming-distance}",
	year          = 2011,
}

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.