Describe the definition and the meaning of NP-completness in computational complexity. Describe the outline of a proof of NP-completness of the problem of determining wether a given logic formula is satisfiable.
See [HOP79] for a detailed answer.