Compact storage for computations involving partitions
Jackie A. Campbell · ACM SIGSAM Bulletin · 1976
If a symbolic problem is sufficiently respectable or well-behaved, it may be possible to compute the solution in a purely numerical language, in terms of arrays of powers, coefficients and numerical codes or labels. The obvious example of good behaviour is the problem in which input, intermediate results and output are all known to be sums of no more than N terms of the form c i T i , where all symbols T i are also known in advance and only coefficients c i remain to be determined. The example is "obvious" because the size of storage for intermediate results is fixed.