Authors: Yuly Shipilevsky
A polynomial-time algorithm for integer factorization, wherein integer factorization reduced to a polynomial-time integer minimization problem over the integer points in a two-dimensional polyhedron.
Comments: 9 Pages. This is a new paper and I changed the title. Thanks.
[v1] 2016-12-06 17:35:29
Unique-IP document downloads: 26 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.