Combinative explosion
One names combinative explosion in Operations research, and in particular in the field of the dynamic Programming, the fact that a small change of the number of data to be considered in a problem in addition commonplace can be enough to make his solution very difficult, even impossible in certain cases with the current computers.
An example speaking about combinative explosion is that of the Fonction of Ackermann.
The combinative explosion can be effectively suppressed in some cases by limitations of good sense in the values (relative or absolute) of the variables to consider, or by more general considerations on the functions in question (the dynamic Programming makes profitable for example the case where the functions are of increasing monotonous type ).
A process used jointly consists, if identical and long calculations are likely to be often repeated, to put in memory their results to avoid these recalculations.
See also: Separation and evaluation.
| Random links: | Rational anticipation | Maixe | Judas Stiff | Cabrières-in Avignon | The Community of communes of Toucycois | Comté_de_Marion,_Iowa |