Strongly polynomial-time integer factorization using Integer Linear Programming

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

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-03-17
DOI
https://doi.org/10.5281/zenodo.15041135
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Strongly polynomial-time integer factorization using Integer Linear Programming

Zenodo (CERN European Organization for Nuclear Research)
Polynomial and algebraic computation
article

Strongly polynomial-time integer factorization using Integer Linear Programming

article en

Abstract

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

Zenodo (CERN European Organization for Nuclear Research)
Universidad Pontificia Comillas (ES)
Openalex Percentile: Top 59%
Polynomial and algebraic computation
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Strongly polynomial-time integer factorization using Integer Linear Programming · Zenodo (CERN European Organization for Nuclear Research) (2025) | TGRS Research Map | TGRS