Jisho

×
還元 (計算複雑性理論)
Links
Wikipedia definition
1. Reduction (complexity)​In computability theory and computational complexity theory, a reduction is a transformation of one problem into another problem. Depending on the transformation used this can be used to define complexity classes on a set of problems. Intuitively, problem A is reducible to problem B if solutions to B exist and give solutions to A whenever A has solutions. Thus, solving A cannot be harder than solving B.
Read “Reduction (complexity)” on English Wikipedia
Read “還元 (計算複雑性理論)” on Japanese Wikipedia
Read “Reduction (complexity)” on DBpedia

Discussions

to talk about this word.