<p>This survey book, <a href="http://www.ams.org/bookstore?fn=50&amp;arg1=salelogic&amp;ikey=DIMACS-35" rel="nofollow">Satisfiability Problem: Theory and Applications</a>, is appropriate for introducing k-SAT to mathematicians. It is not very recent but still very valuable resource.</p>

CC BY-SA 2.5
2011-01-14T16:22:28.637Z
2011-01-14T16:54:56.737Z
2011-01-14T16:54:56.737Z
Mohammad Al-Turkistany
<p>From the Lecture Note reference thread, we have <a href="https://cstheory.stackexchange.com/questions/4074/what-lecture-notes-should-everyone-read/4075#4075">this document</a>. </p>

CC BY-SA 2.5
2011-01-14T16:12:53.587Z
2011-01-14T16:12:53.587Z
2017-04-13T12:32:28.077Z
Gautam Kamath
<p>I'd like to know where I can turn for a good, gentle introduction to k-SAT (this may be for mathematicians that may not have a good computer science background).  I'd also like to know papers that maybe survey or explain current methods used to solve k-SAT.  Finally, I'm interested in the best known methods for solving k-SAT.  I'd like to get an idea of the best average case and best worst case behavior.</p>

<p>In short, I'm looking for papers that will help someone in mathematics (not computer science) become much more of an expert in k-SAT.</p>

CC BY-SA 2.5
2011-01-14T16:17:12.730Z
There are some good answers about k-SAT on the site: [lecture notes](http://cstheory.stackexchange.com/questions/4074/what-lecture-notes-should-everyone-read/4075#4075), [upper](http://cstheory.stackexchange.com/q/1060/1800) and [lower](http://cstheory.stackexchange.com/q/93/1800) bounds, with many links within. Try searching the tag [sat](http://cstheory.stackexchange.com/questions/tagged/sat) also.
Hsien-Chih Chang 張顯之
<reference-request><sat><survey>
Information on k-SAT (Introduction, Bounds, Methods, etc.)
Matt Groff
# Information on k-SAT (Introduction, Bounds, Methods, etc.)

(Asked by: username_0 on 2011-01-14)

I'd like to know where I can turn for a good, gentle introduction to k-SAT (this may be for mathematicians that may not have a good computer science background). I'd also like to know papers that maybe survey or explain current methods used to solve k-SAT. Finally, I'm interested in the best known methods for solving k-SAT. I'd like to get an idea of the best average case and best worst case behavior.

In short, I'm looking for papers that will help someone in mathematics (not computer science) become much more of an expert in k-SAT.

**Tags:** reference-request, sat, survey
> **Comments:**
> **username_1**: There are some good answers about k-SAT on the site: [lecture notes](http://cstheory.stackexchange.com/questions/4074/what-lecture-notes-should-everyone-read/4075#4075), [upper](http://cstheory.stackexchange.com/q/1060/1800) and [lower](http://cstheory.stackexchange.com/q/93/1800) bounds, with many links within. Try searching the tag [sat](http://cstheory.stackexchange.com/questions/tagged/sat) also.  

---

## 2 answers

### Answer by username_3 on 2011-01-14. Score: 6 | Accepted answer

From the Lecture Note reference thread, we have [this document](https://cstheory.stackexchange.com/questions/4074/what-lecture-notes-should-everyone-read/4075#4075).


---

### Answer by username_2 on 2011-01-14. Score: 5

This survey book, [Satisfiability Problem: Theory and Applications](http://www.ams.org/bookstore?fn=50&arg1=salelogic&ikey=DIMACS-35), is appropriate for introducing k-SAT to mathematicians. It is not very recent but still very valuable resource.


---

