Runtime Behavior
As mentioned briefly above, though the problem is NP-complete, many practical instances can be solved much more quickly. Many practical problems are actually "easy", so the SAT solver can easily find a solution, or prove that none exists, relatively quickly, even though the instance has thousands of variables and tens of thousands of constraints. Other much smaller problems exhibit run-times that are exponential in the problem size, and rapidly become impractical. Unfortunately, there is no reliable way to tell the difficulty of the problem without trying it. Therefore, almost all SAT solvers include time-outs, so they will terminate even if they cannot find a solution. Finally, different SAT solvers will find different instances easy or hard, and some excel at proving unsatisfiability, and others at finding solutions. All of these behaviors can be seen in the SAT solving contests.
Read more about this topic: Boolean Satisfiability Problem
Famous quotes containing the word behavior:
“Children can’t make their own rules and no child is happy without them. The great need of the young is for authority that protects them against the consequences of their own primitive passions and their lack of experience, that provides with guides for everyday behavior and that builds some solid ground they can stand on for the future.”
—Leontine Young (20th century)