-

 

 

 




Optimization Online





 

Integer Factorization is in P

Yuly Shipilevsky (yulysh2000***at***yahoo.ca)

Abstract: A polynomial-time algorithm for integer fac-torization, wherein integer factorization is reduced to the integer programming minimization problem.

Keywords: reformulation, integer factorization, integer programming, polynomial-time algorithm, NP-hard

Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )

Category 2: Applications -- OR and Management Sciences (Finance and Economics )

Category 3: Applications -- Science and Engineering (Other )

Citation: Submitted to SIAM J. On Optimization

Download: [PDF]

Entry Submitted: 02/11/2011
Entry Accepted: 02/11/2011
Entry Last Modified: 08/29/2012

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society