reduction term
transforming problem A into problem B to solve A using B
Foundation of NP-completeness proofs. 'X reduces to Y' = if you can solve Y, you can solve X. Engineering use: 'this reduces to graph coloring' = it's hard.
transforming problem A into problem B to solve A using B
Foundation of NP-completeness proofs. 'X reduces to Y' = if you can solve Y, you can solve X. Engineering use: 'this reduces to graph coloring' = it's hard.