@InProceedings{gent+1993,
  author       = {Gent, Ian P. and Walsh, Toby},
  title        = {Towards an understanding of hill-climbing procedures for
                  {SAT}},
  booktitle    = {Proceedings of the Eleventh National Conference on Artificial
                  Intelligence},
  year         = 1993,
  series       = {AAAI'93},
  pages        = {28–33},
  publisher    = {AAAI Press},
  isbn         = 0262510715,
  abstract     = {Recently several local hill-climbing procedures for
                  propositional satisfiability have been proposed which are
                  able to solve large and difficult problems beyond the reach
                  of conventional algorithms like Davis-Putnam. By the
                  introduction of some new variants of these procedures, we
                  provide strong experimental evidence to support our
                  conjecture that neither greediness nor randomness is
                  important in these procedures. One of the variants introduced
                  seems to offer significant improvements over earlier
                  procedures. In addition, we investigate experimentally how
                  performance depends on their parameters. Our results suggest
                  that runtime scales less than simply exponentially in the
                  problem size.},
  numpages     = 6,
  location     = {Washington, D.C.},
  url          = {https://dl.acm.org/doi/10.5555/1867270.1867275}
}