<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>01114011</id>
  <dt>a</dt>
  <an>01114011</an>
  <augroup>
    <au>van Maaren, Hans</au>
  </augroup>
  <ti>On the use of second order derivatives for the satisfiability problem.</ti>
  <so>Du, Dingzhu (ed.) et al., Satisfiability problem: theory and applications. DIMACS workshop, Piscataway, NJ, USA, March 11-13, 1996. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 35, 677-687 (1997).</so>
  <py>1997</py>
  <pu>Providence, RI: AMS, American Mathematical Society</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>CNF formulae</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: We study smooth convex and concave transforms of CNF formulae, introduced by van Maaren, Groote and Rozema. First- and second-order Taylor expansions of these transforms are used to design a LP-based branching algorithm, where the branching variable is determined by the smallest eigenvalue of the Hessian of the concave transform. Experiments with random 3-SAT formulae show that the resulting search trees are small.</ab>
    <rv></rv>
  </abgroup>
</item>