| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436496 | Theoretical Computer Science | 2013 | 12 Pages |
Abstract
We present a CAT (Constant Amortized Time) algorithm for generating all plane partitions of an integer n, that is, all integer matrices with non-increasing rows and columns having sum n.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
