Computing an Integer Prime Factoring in O(n^2.5)
Charles Sauerbier
TL;DR
This paper discusses the complexity of integer prime factoring algorithms but is withdrawn due to significant flaws in the analysis and reasoning, limiting its contribution.
Contribution
The paper attempts to analyze prime factoring algorithms but contains a naive mistake that undermines its complexity claims.
Findings
Correct operation count analysis
Incorrect complexity interpretation
Paper withdrawn due to flawed reasoning
Abstract
Paper is withdrawn. On review the paper contributes little of significance. The runtime analysis of the algorithms presented, while correct in terms of number of operations, does not represent the complexity of the algorithms in terms of "bits input". A naive mistake in reasoning.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Numerical Methods and Algorithms · Algorithms and Data Compression