Name
Abstract | ||
|---|---|---|
In this paper we give a simple algorithm to generate all partitions of a positive integer n. The problem is one of the basic problems in combinatorics, and has been extensively studied for a long time. Our algorithm generates each partition of a given integer in constant time for each without repetition, while best known algorithm generates each partition in constant time on “average.” Also, we propose some algorithms to generate all partitions of an integer with some additional property in constant time. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1093/ietfec/e90-a.5.888 | IEICE Transactions |
Keywords | Field | DocType |
constant time generation,additional property,best known algorithm,basic problem,long time,positive integer n,constant time,integer partitions,simple algorithm,integer partition,generation,algorithm | Integer,Discrete mathematics,Combinatorics,SIMPLE algorithm,Partition (number theory),Mathematics | Journal |
Volume | Issue | ISSN |
E90-A | 5 | 0916-8508 |
Citations | PageRank | References |
5 | 0.64 | 19 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katsuhisa Yamanaka | 1 | 60 | 15.73 |
| Shin-Ichiro Kawano | 2 | 14 | 1.60 |
| Yosuke Kikuchi | 3 | 83 | 6.50 |
| Shin-ichi Nakano | 4 | 246 | 24.40 |