The Query Complexity of Finding Local Minima in the Lattice

Beimel et al. "The Query Complexity of Finding Local Minima in the Lattice." Annual Conference on Computational Learning Theory, 1998. doi:10.1145/279943.280000

[Beimel et al. "The Query Complexity of Finding Local Minima in the Lattice." Annual Conference on Computational Learning Theory, 1998.](https://mlanthology.org/colt/1998/beimel1998colt-query/) doi:10.1145/279943.280000

@inproceedings{beimel1998colt-query,
  title     = {{The Query Complexity of Finding Local Minima in the Lattice}},
  author    = {Beimel, Amos and Geller, Felix and Kushilevitz, Eyal},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1998},
  pages     = {294-302},
  doi       = {10.1145/279943.280000},
  url       = {https://mlanthology.org/colt/1998/beimel1998colt-query/}
}