Exercises of polynomial and turing reductions I'm following a graduated course in theoretical computer sicence. A good part the theory we see in this course has to do with polynomial and Turing reductions of NP problem (to prove NP-completeness), mostly including gadgets. However the course has very few exercises to practice ourselves and the teacher is reluctant to give us some more. Is there any resources, web or books, that could fill this gap for me? I'm talking about problems and possibly their solutions and some explanation about the process of finding the reduction.

Thanks.
A good start is Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson. Chapter 3.2 discusses techniques and 3.3 has exercises. You can find more in the books about complexity everyone should read.