Original-host source document
Interactive PDF served from the official AAR archive
Public project summary
In this project, I am researching and analyzing different prime factorization algorithms. After making a list of different algorithms, I will figure out the time complexity. Then, I will code the algorithm and retrieve real running time on variously sized input data sets. After collecting my data, I will compare each algorithm and extrapolate the existence of "fast" factorization algorithm.
- Public attribution
- Andrew C.
- Issue
- Volume 4 · 2018-19
- Research area
- STEAM
- Source program
- Advanced Authentic Research · PAUSD