 | This article needs additional citations for verification. (September 2014) |
In mathematics, a combinatorial explosion is the rapid growth of the complexity of a problem due to the way its combinatorics depends on input, constraints and bounds. 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.
- ^ Krippendorff, Klaus. "Combinatorial Explosion". Web Dictionary of Cybernetics and Systems. PRINCIPIA CYBERNETICA WEB. Archived from the original on 6 August 2010. Retrieved 29 November 2010.
- ^ http://intelligence.worldofcomputing/combinatorial-explosion Archived 2011-08-23 at the Wayback Machine Combinatorial Explosion.