This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Estimating the Work in Integer Partitioning
January/February 2003 (vol. 5 no. 1)
pp. 48-56
April K. Andreas, Southern Methodist University
Isabel Beichl, National Institute of Standards and Technology

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.

Index Terms:
integer partition, algorithms, Monte Carlo methods, multiprocessing
Citation:
April K. Andreas, Isabel Beichl, "Estimating the Work in Integer Partitioning," Computing in Science and Engineering, vol. 5, no. 1, pp. 48-56, Jan.-Feb. 2003, doi:10.1109/MCISE.2003.1166552
Usage of this product signifies your acceptance of the Terms of Use.