eCommons

 

Partitions Generators

Other Titles

Abstract

Several algorithms for generating partitions of positive numbers are given. First, an algorithm for generating all the partitions is given, then algorithms for generating of all partitions in which all terms are smaller than a given n, between n and m, and partitions of n to a given k. Each of the algorithms produces the whole sequence in a time proportional to the length of that sequence; moreover, each new partition is produced in no more than a constant number of steps independent on the parameters of the algorithm.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1974-02

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR74-199

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record