Quantum and classical query complexities of local search are polynomially related
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

Miklos Santha, Mario Szegedy
Quantum and classical query complexities of local search are polynomially related
STOC, 2004.

STOC 2004
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2004-SanthaS,
	author        = "Miklos Santha and Mario Szegedy",
	booktitle     = "{Proceedings of the 36th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/1007352.1007427",
	isbn          = "1-58113-852-0",
	pages         = "494--501",
	publisher     = "{ACM}",
	title         = "{Quantum and classical query complexities of local search are polynomially related}",
	year          = 2004,
}

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.