Data Structures and Algorithms


Integer Factorization is in P

Authors: Yuly Shipilevsky

A polynomial-time algorithm for integer factorization, wherein integer factOrization reduced to a convex polynomial-time integer minimization problem.

Comments: 10 Pages.

Download: PDF

Submission history

[v1] 2015-05-23 18:53:26

Unique-IP document downloads: 119 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus