Simple constant amortized time generation of fixed length numeric partitions

DOI10.1016/J.JALGOR.2004.01.002MaRDI QIDQ4651808zbMATH OpenOpenAlexFDO

Authors John M. Boyer

Publication date 22 February 2005

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.01.002

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Combinatorial aspects of partitions of integers (05A17)

Recommendations

• Fast algorithms for genegrating integer partitions
• A complete anytime algorithm for number partitioning
• An efficient representation of partitions of integers
• scientific article; zbMATH DE number 205341
• Randomized methods for the number partitioning problem
• Constant time enumeration by amortization
• A Fast Algorithm for Generating Set Partitions

Cited in

(5)

• On the exhaustive generation of plane partitions
• A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
• A CAT algorithm for the exhaustive generation of ice piles
• Generating bracelets in constant amortized time
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order

This page was built for publication: Simple constant amortized time generation of fixed length numeric partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651808)