Lower bounds for local search by quantum arguments

Scott Aaronson. Lower bounds for local search by quantum arguments. In László Babai, editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004. pages 465-474, ACM, 2004. [doi]

@inproceedings{Aaronson04a,
  title = {Lower bounds for local search by quantum arguments},
  author = {Scott Aaronson},
  year = {2004},
  doi = {10.1145/1007352.1007358},
  url = {http://doi.acm.org/10.1145/1007352.1007358},
  tags = {search},
  researchr = {https://researchr.org/publication/Aaronson04a},
  cites = {0},
  citedby = {0},
  pages = {465-474},
  booktitle = {Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004},
  editor = {László Babai},
  publisher = {ACM},
  isbn = {1-58113-852-0},
}