Now showing items 1-1 of 1
Analysis of an Enumeration Algorithm for Unordered K-partitions of N
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74009-R
In many combinatorial problems, the need to compute the number of unrestricted partitions of n or to enumerate over the set of unrestricted partitions of n occurs frequently. Let two positive integers k and n be given, ...