Skip to main content
Article thumbnail
Location of Repository

Modern Techniques for Solving Boolean Satisfiability ∗

By Andreas Weis


The problem of Boolean satisfiability (SAT) belongs to the class of NPcomplete problems, which are currently believed to have exponential worst case complexity. However, in the recent past there have been many successful attempts to build algorithms, that are able to solve the majority o

Year: 2006
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • http://www4.informatik.tu-muen... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.