vix.ing · top · new · best · stats · spec

Computing an Integer Prime Factoring in O(n2.5)

2009/12/21 by Charles Sauerbier, Sauerbier, Charles
Computer Science · #Algorithms and Data Compression #Computability, Logic, AI Algorithms #Numerical Methods and Algorithms #cs.CC #cs.DS

paper · pdf · doi:10.48550/arxiv.0912.4084

This paper has been withdrawn by the author. Paper is withdrawn. On review the paper contributes nothing 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

arxiv created 2011/07/28 · arxiv updated 2011/07/29

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.

Related