Jump to content

Decomposition method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Swpb (talk | contribs) at 18:59, 23 October 2023 (Undid revision 1177088730 by Iterresise (talk)). 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 subproblems. The term may specifically refer to: