2008/02/28 by N. A. Carella, Carella, N. A.
Computer Science · Engineering · #11Y05 #FOS: Mathematics #General Mathematics (math.GM) #Matrix Theory and Algorithms #Number Theory (math.NT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.0802.4242
openalex publication_date 2008/02/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This note continues the theoretical development of deterministic integer factorization algorithms based on systems of polynomials equations. The main result establishes a new deterministic time complexity bench mark in integer factorization.