Note on Integer Factoring Methods IV
arXiv:0802.4242
Abstract
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.
20 Pages, New Version