Boolean satisfiability from theoretical hardness to practical success

  • Authors:
  • Sharad Malik;Lintao Zhang

  • Affiliations:
  • Princeton University, Princeton, NJ;Microsoft Research Asia, Beijing, China

  • Venue:
  • Communications of the ACM - A Blind Person's Interaction with Technology
  • Year:
  • 2009

Quantified Score

Hi-index 0.03

Visualization

Abstract

Satisfiability solvers can now be effectively deployed in practical applications.