New upper and lower bounds for randomized and quantum local search
暂无分享,去创建一个
[1] Donna Crystal Llewellyn,et al. Local optimization on graphs , 1989, Discret. Appl. Math..
[2] Christoph Dürr,et al. A Quantum Algorithm for Finding the Minimum , 1996, ArXiv.
[3] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[4] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[5] Jan Karel Lenstra,et al. A decade of combinatorial optimization , 1997 .
[6] Andris Ambainis,et al. Polynomial degree vs. quantum query complexity , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[7] H. Buhrman,et al. Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..
[8] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[9] Mario Szegedy,et al. All Quantum Adversary Methods Are Equivalent , 2005, ICALP.
[10] Miklos Santha,et al. Quantum and Classical Query Complexities of Local Search Are Polynomially Related , 2004, STOC '04.
[11] Frédéric Magniez,et al. Lower bounds for randomized and quantum query complexity using Kolmogorov arguments , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[12] Craig A. Tovey,et al. Dividing and Conquering the Square , 1993, Discret. Appl. Math..
[13] Robert Spalek,et al. Lower Bounds on Quantum Query Complexity , 2005, Bull. EATCS.
[14] Ingo Althöfer,et al. On the Deterministic Complexity of Searching Local Maxima , 1993, Discret. Appl. Math..
[15] Christos H. Papadimitriou,et al. On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..
[16] Michael E. Saks,et al. Quantum query complexity and semi-definite programming , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[17] Yves F. Verhoeven. Enhanced algorithms for Local Search , 2006, Inf. Process. Lett..
[18] Andris Ambainis,et al. Quantum lower bounds by quantum arguments , 2000, STOC '00.
[19] Scott Aaronson,et al. Lower bounds for local search by quantum arguments , 2003, STOC '04.
[20] Shengyu Zhang,et al. On the power of Ambainis lower bounds , 2005, Theor. Comput. Sci..
[21] Abraham P. Punnen,et al. Approximate local search in combinatorial optimization , 2004, SODA '04.
[22] D. Aldous. Minimization Algorithms and Random Walk on the $d$-Cube , 1983 .
[23] Mehdi Mhalla,et al. Quantum Query Complexity of Some Graph Problems , 2004, SIAM J. Comput..