New upper and lower bounds for randomized and quantum local search

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 634-643

  Zhang, Shengyu ^a  

^a Princeton University   (United States)

Author keywords

Local search; Lower bound; Quantum algorithm; Query complexity (decision tree complexity); Randomized algorithm

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE; GRAPH THEORY;

LOWER BOUND; QUANTUM ALGORITHMS; QUERY COMPLEXITY (DECISION TREE COMPLEXITY); RANDOMIZED ALGORITHMS;

QUANTUM THEORY;

EID: 33748122663     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132605     Document Type: Conference Paper

References (24)

1. K. Aardal, S. Hoesel, J.K, Lenstra, L. Stougie. A Decade of Combinatorial Optimization, CWI Tracts 122, pp. 5-14, 1997.
2. S. Aaronson. Lower Bounds for Local Search by Quantum Arguments. Proceedings of the thirty-sixth Annual ACM Symposium on Theory of Computing, pp. 465-474, 2004.
3. E. Aarts and J. Lenstra, John Wiley & Sons, Inc. New York, NY, USA, 1997.
4. D. Aldous. Minimization Algorithms and Random Walk on the d-Cube. Annals of Probability, 11(2), pp. 403-413, 1983.
5. I. Althofer and K. Koschnich. On the Deterministic Complexity of Searching Local Maxima. Discrete Applied Mathematics 43, pp. 111-113, 1993.
6. A. Ambainis, Polynomial Degree vs, Quantum Query Complexity. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 230-239, 2000.
7. A. Ambainis. Quantum Lower Bounds by Quantum Arguments, Journal of Computer and System Sciences, 64, pp. 750-767, 2002.
8. H. Barnum, M. Saks, M. Szegedy. Quantum Query Complexity and Semidefinite Programming. Proceedings of the 18th Annual IEEE Conference on Computational Complexity, pp. 179-193, 2003.
9. R. Beals, H. Buhrman, R. Cleve, M.Mosca, R. de Wolf. Quantum Lower Bounds by Polynomials. Journal of ACM, 48, pp. 778-797, 2001.
10. H. Buhrman and R. de Wolf, Complexity Measures and Decision Tree Complexity: a survey. Theoretical Computer Science, 288(1), pp. 21-43, 2002.
11. C. Durr and P. Hoyer. A Quantum Algorithm for Finding the Minimum, quant-ph/9607014, 1996.
12. L. Grover. A Fast Quantum Mechanical Algorithm for Database Search, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp. 212-219, 1996.
13. P. Hoyer and R. Spalek. Lower Bounds on Quantum Query Complexity, Bulletin of the European Association for Theoretical Computer Science 87, pp. 78-103, 2005.
14. D. Johnson, C. Papadimitriou, and M. Yannakakis. How Easy is Local Search, Journal of Computer and System Sciences 37, pp. 429-448, 1988.
15. S. Laplante and F. Magniez. Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. Proceedings of the 19th Annual IEEE Conference on Computational Complexity, pp. 294-304, 2004.
16. D. Llewellyn and C. Tovey, Dividing and Conquering the Square. Discrete Applied Mathematics 43, pp. 131-153, 1993.
17. D. Llewellyn, C. Tovey, M. Trick. Local Optimization on Graphs. Discrete Aplied Mathematics 23, pp. 157-178, 1989. Erratum; 46, pp. 93-94, 1993.
18. N. Megiddo and C. Papadimitriou, On Total Functions, Existence Theorems, and Computational Complexity, Theoretical Computer Science 81, pp. 317-324, 1991.
19. J. Orlin, A. Punnen, A. Schulz. Approximate Local Search in Combinatorial Optimization. SIAM Journal on Computing, 33(5), pp. 1201-1214, 2004.
20. M. S ant ha and M. Szegedy, Quantum and Classical Query Complexities of Local Search Are Polynomially Related. Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pp.494-501, 2004.
21. R. Spalek and M. Szegedy. All Quantum Adversary Methods Are Equivalent. Proceedings of 32nd International Colloquium on Automata, Languages and Programming, pp. 1299-1311, LNCS 3580, Lisboa, Portugal, 2005.
22. Y. Verhoeven, Enhanced Algorithms for Local Search, Information Processing Letters 97, 171-176, 2006.
23. S. Zhang. On the Power of Ambainis Lower Bounds, Theoretical Computer Science, 339(2-3), pp. 241-256, 2005.
24. S. Zhang. New Upper and Lower Bounds for Randomized and Quantum Local Search, quant-ph/0603034, 2006.