Information on k-SAT (Introduction, Bounds, Methods, etc.)

Question

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.

There are some good answers about k-SAT on the site: lecture notes, upper and lower bounds, with many links within. Try searching the tag sat also. — Hsien-Chih Chang 張顯之, Jan 14 '11 at 16:17

score 6 · Accepted Answer · edited Apr 13 '17 at 12:32

6

From the Lecture Note reference thread, we have this document.

edited Apr 13 '17 at 12:32

Community

1

answered Jan 14 '11 at 16:12

Gautam Kamath

436
3
5

Mohammad Al-Turkistany · Answer 2 · 2011-01-14T16:54:56.737

5

This survey book, Satisfiability Problem: Theory and Applications, is appropriate for introducing k-SAT to mathematicians. It is not very recent but still very valuable resource.

edited Jan 14 '11 at 16:54

answered Jan 14 '11 at 16:22

Mohammad Al-Turkistany

20,928
5
63
149

Information on k-SAT (Introduction, Bounds, Methods, etc.)

2 Answers2

Linked