Simply and intuitively, what is the difference between np-hard and np-complete problems?
What is the difference between P, NP, NP-Hard and NP-complete problems? How can we prove the circuit-SAT is NP-complete?