Decomposition method

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Decomposition method is a generic term for solutions of various problems and design of algorithms in which the basic idea is to decompose the problem into subproblems. The term may specifically refer to one of the following.