Combinatorial explosion
Rapid growth of the complexity of a problem due to its combinatorial properties / From Wikipedia, the free encyclopedia
In mathematics, a combinatorial explosion is the rapid growth of the complexity of a problem due to how the combinatorics of the problem is affected by the input, constraints, and bounds of the problem. Combinatorial explosion is sometimes used to justify the intractability of certain problems.[1][2] Examples of such problems include certain mathematical functions, the analysis of some puzzles and games, and some pathological examples which can be modelled as the Ackermann function.
This article needs additional citations for verification. (September 2014) |