NP-hardness of CIRCUIT-SAT

49 Views Asked by At

How to prove NP-hardness of CIRCUIT-SAT, without the use of other NP-complete problems but using Turing machines?

And, if it is possible, I need a full proof, not a sketch.