Quote:
Originally Posted by tetramur

The first link refers to a 2000 paper by Khachiyan and Porkolab. I don't have access to that paper. But, judging by the post
here,
Quote:
Moreover, even for semidefinite programming problems (SDP) in its general setting (without extra assumptions like strict complementarity) no polynomialtime algorithms are known, and there are examples of SDPs for which every solution needs exponential space. See Leonid Khachiyan, Lorant Porkolab. "Computing Integral Points in Convex Semialgebraic Sets". FOCS 1997: 162171 and Leonid Khachiyan, Lorant Porkolab "Integer Optimization on Convex Semialgebraic Sets". Discrete & Computational Geometry 23(2): 207224 (2000).

I would go so far as to say that the paper doesn't say what the claimant says it says.
I would also imagine that, if the 2000 paper actually led directly to factorization in polynomial time as indicated, somebody would have noticed right away.
I also point out that the claimant doesn't actually
give an algorithm for solving the integer programming problem in polynomial time. He merely asserts that it can be done, and then says "do it." If
I had a polynomial time factorization method, I would give examples applying it to "challenge" and "most wanted" factorizations.