Authors: Yuly Shipilevsky
Comments: 12 Pages.
We reduce integer factorization problem to the NP-hard problem of minimizing
a quadratic polynomial with integer coefficients over the integer points
in a quadratically constrained two-dimensional region.
Next, we reduce integer factorization problem to the problem of enumeration
of vertices of integer hull of a special two-dimensional rational polyhedron,
solvable in time polynomial by Hartmann's algorithm.
Finally, as we find a polynomial-time algorithm to solve an NP-hard problem,
we conclude that P = NP
Category: Data Structures and Algorithms