Computing an Integer Prime Factoring in O(n^2.5)
Charles Sauerbier · arXiv (Cornell University) · 2009
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.