New upper and lower bounds for randomized and quantum local search

@inproceedings{Zhang2006NewUA,
  title={New upper and lower bounds for randomized and quantum local search},
  author={Shengyu Zhang},
  booktitle={STOC},
  year={2006}
}
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexity theory and many other areas in theoretical computer science. In this paper, we study the problem in the randomized and quantum query models and give new lower and upper bound techniques in both models.The lower bound technique works for any graph that contains a product graph as a subgraph. Applying it to the… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Minimization Algorithms and Random Walk on the d-Cube

  • D. Aldous
  • Annals of Probability,
  • 1983
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…