Transitivity of Polynomial Time Reduction
Define: to mean that A is polynomial time reducible to B.
Transitivity: and implies
Example:
- Every problem in NP is known to be polynomial time reducible to Hamiltonian path.
- Hamiltonian path is polynomial time reducible to spanning tree of degree 4.
- Therefore, every problem in NP is polynomial time reducible to spanning tree of degree 4.