Issue No. 01 - January/February (2003 vol. 5)
April K. Andreas , Southern Methodist University
Isabel Beichl , National Institute of Standards and Technology
<p>An integer partition for a set of integers is a way to divide that set of numbers into two or more subsets, with approximately the same sum in each subset and the same number of elements in each subset. The authors have developed a method to estimate the work done by commonly used algorithms. Their method is based on one of Knuth's methods for estimating the size of backtrack trees.</p>
integer partition, algorithms, Monte Carlo methods, multiprocessing
A. K. Andreas and I. Beichl, "Estimating the Work in Integer Partitioning," in Computing in Science & Engineering, vol. 5, no. , pp. 48-56, 2003.