product iamge

The Satisfiability Problem: Algorithms and Analyses

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Uwe Schöning, Jacobo Torán
Series: Mathematik fur Anwendungen; 3
Publisher: Lehmanns Media
Year: 2013

Language: English

Preface
Contents
Introduction
1 First Definitions and Results
2 Resolution Calculus
3 Special Cases Solvable in Polynomial Time
4 Backtracking and DPLL Algorithms
5 Local Search and Hamming Balls
6 More SAT Algorithms
7 Random Clauses and Physical Approaches
8 Heavy Tail Distributions and Restarts
9 Final Discussion
Appendix: Programming in Pseudo Code
Appendix: Graphs
Appendix: Asymptotic Notation and Recurrences
Appendix: Efficient Algorithms, P and NP
Appendix: Probabilistic Algorithms and the Class RP
Appendix: Boolean Circuits
Appendix: SAT is NP-complete
Appendix: Binary Decision Diagrams (BDD’s)
Appendix: Random Variables
Appendix: Markov Chains
Appendix: Estimations with Binomial Coefficients
Bibliography
Index