Jump to content

Decomposition method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Twri (talk | contribs) at 17:45, 10 October 2008. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 question into subproblems. The term may specifically refer to one of the following.