Login / Signup

A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae.

O. DubiosYacine Boufkhad
Published in: J. Algorithms (1997)
Keyphrases
  • upper bound
  • satisfiability problem
  • special case
  • lower bound
  • phase transition
  • sat problem
  • worst case
  • search algorithm
  • computational complexity
  • boolean formula
  • sat solving
  • branch and bound algorithm