SAT for pedestrians
Computational Complexity
2014-08-15 v1 Logic
Abstract
The aim of this short note is mainly pedagogical. It summarizes some knowledge about Boolean satisfiability (SAT) and the P=NP? problem in an elementary mathematical language. A convenient scheme to visualize and manipulate CNF formulae is introduced. Also some results like the formulae for the number of unsatisfied clauses and the number of solutions might be unknown.
Cite
@article{arxiv.1408.3286,
title = {SAT for pedestrians},
author = {Bernd R. Schuh},
journal= {arXiv preprint arXiv:1408.3286},
year = {2014}
}