An algorithm for partitioning an integer n as a sum of k positive integers
An algorithm for finding all partitions of an integer n as a sum of k positive integers is discussed. The number of the partitions can also be obtained. © 2007 Taylor & Francis Group, LLC.
Saved in:
| Main Author: | |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85024564334&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/61220 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |