Note on Integer Factoring Methods IV

Simple item page
dc.creatorCarella, N. A.
dc.date2008-02-28
dc.date2008-09-25
dc.date.accessioned2026-07-07T10:04:47Z
dc.date.available2026-07-07T10:04:47Z
dc.descriptionThis 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.
dc.description20 Pages, New Version
dc.identifierhttps://arxiv.org/abs/0802.4242
dc.identifierhttp://arxiv.org/abs/0802.4242
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169804
dc.subjectNumber Theory
dc.subjectGeneral Mathematics
dc.subject11Y05
dc.titleNote on Integer Factoring Methods IV
dc.typetext

Files

Collections

arXiv