Question: List of all possible reduction between NP problems

Hi All,


We use reductions to prove that a problem is NP-Complete by reducing a
known
NP-complete problem to it. Once we prove that a prblem 'A' is
NP-complete by
reducing an NP-complete problem 'B' which is already known.....the two
problems will be in the same class.


For example:


SAT<=p CNF
CNF<=p Clique


Is there a web resource that explain in detail all the possible
polynomial reductions between the different problems?


Thanks,
NPC.

.

Relevant Pages