1. In switching theory, the realization of an n-variable switching function as a composition of functions, each of which has less than n variables. Like other minimizations, decomposition is facilitated by Karnaugh maps.
2. In programming, the analysis of a problem into simpler subproblems. See modular programming, program decomposition.