NobleBlocks
Public

Strongly polynomial-time integer factorization using Integer Linear Programming

Published in Zenodo (CERN European Organization for Nuclear Research) • Mar 17, 2025
NobleIDNI1P93W88R70S54
Authors:
Devashish Sonowal

Abstract

We use Integer Linear Programming to prove that there exists a strongly polynomial-time integer factorization algorithm.

Subject

Integer programming
Integer (computer science)
Mathematics
Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!