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.
In mathematics, a combinatorial surge is akin to an exponential growth in problem complexity due to input, constraints, and bounds affecting the problem's combinatorial structure.