Strongly polynomial-time integer factorization using Integer Linear Programming
Year: 2025
Type: article
Abstract: We use Integer Linear Programming to prove that there exists a strongly polynomial-time integer factorization algorithm.
Author: Sonowal, Devashish
Institution: Universidad Pontificia Comillas
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6949830215
FWCI:
Cites:
Cited by:
Related to: