Computing an Integer Prime Factoring in O(n^2.5)
Data Structures and Algorithms
2011-07-29 v3 Computational Complexity
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.
Cite
@article{arxiv.0912.4084,
title = {Computing an Integer Prime Factoring in O(n^2.5)},
author = {Charles Sauerbier},
journal= {arXiv preprint arXiv:0912.4084},
year = {2011}
}
Comments
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