New upper and lower bounds for randomized and quantum local search
DOI10.1145/1132516.1132605zbMath1301.68132MaRDI QIDQ2931424
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132605
local search; randomized algorithm; lower bound; quantum algorithm; query complexity; decision tree complexity
68R10: Graph theory (including graph drawing) in computer science
81P68: Quantum computation
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W20: Randomized algorithms
68Q12: Quantum algorithms and complexity in the theory of computing
Related Items