Computing an Integer Prime Factoring in O(n^2.5)

Details Computing an Integer Prime Factoring in O(n^2.5) Computing an Integer Prime Factoring in O(n^2.5)

2009-12-21

arxiv.org/abs/0912.4084v3

Computer Science

Data Structures and Algorithms

This paper has been withdrawn by the author. Paper is withdrawn. On review the paper contributes nothing of significance. The

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing an Integer Prime Factoring in O(n^2.5) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing an Integer Prime Factoring in O(n^2.5), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing an Integer Prime Factoring in O(n^2.5) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-301786