Draft:Fast algorithm AZ1 integer partitions
Submission declined on 17 March 2025 by Curb Safe Charmer (talk). This submission is not adequately supported by reliable sources. Reliable sources are required so that information can be verified. If you need help with referencing, please see Referencing for beginners and Citing sources. This draft's references do not show that the subject qualifies for a Wikipedia article. In summary, the draft needs multiple published sources that are:
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
| ![]() |
My algorithm ZS1 for generating integer partitions in standard representation anti-lexicography order in my thesis “Algorithms for generating integer partitions” – University of Ottawa, 1993, followed by my paper "Fast algorithms for generating integer partitions – (Zoghbi Stojmenovic) International Journal for Computing Math 1998, vol 70, pp 319-332" is considered by many professionals the state of the art. Algorithm AZ1 is an optimization and acceleration of ZS1. On AMD Ryzen 7 5800HS,8 cores, 16 processors, 16 RAM the time saving was about 25%. On Intel TM-i7-12700H 2.3Ghz, algorithm AZ1 was a little bit better than ZS1 with no remarkable improvement.
References
[edit][[
]]