Hang Dinh, Alexander Russell. Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs. In Ashish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld, editors, Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings. Volume 5171 of Lecture Notes in Computer Science, pages 385-401, Springer, 2008. [doi]
@inproceedings{DinhR08:0,
title = {Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs},
author = {Hang Dinh and Alexander Russell},
year = {2008},
doi = {10.1007/978-3-540-85363-3_31},
url = {http://dx.doi.org/10.1007/978-3-540-85363-3_31},
tags = {graph-rewriting, rewriting, search},
researchr = {https://researchr.org/publication/DinhR08%3A0},
cites = {0},
citedby = {0},
pages = {385-401},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings},
editor = {Ashish Goel and Klaus Jansen and José D. P. Rolim and Ronitt Rubinfeld},
volume = {5171},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-85362-6},
}