How to prove Satisfiability of boolean formulas is NP-complete

[XodoX]

How to prove "Satisfiability of boolean formulas is NP-complete"

I can not figure out how to prove this. I have been trying to find something that explains it step by step, possibly even with an example. I can not find anything. Can somebody perhaps explain how you prove it or show me where I can find a thorough explanation ?

 

[LCKurtz]

I can not figure out how to prove this. I have been trying to find something that explains it step by step, possibly even with an example. I can not find anything. Can somebody perhaps explain how you prove it or show me where I can find a thorough explanation ?

Maybe this is what you are looking for:

http://en.wikipedia.org/wiki/Cook–Levin_theorem