Integer Factorization Is Not in P: Logical Proof

EasyChair Preprint no. 12579, version history

Rama Murthy Garimella

Version

Date

Pages

Version notes

March 18, 2024

—

July 1, 2024

A subsection titled: Towards determination of NP COMPLETENESS of INTEGER FACTORIZATION PROBLEM is added.

Thus, an approach to resolve the P = NP conjecture is included.

Keyphrases: Highly Composite Numbers, polynomial-time algorithm, prime numbers, unique factorization

BibTeX entry

BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:

@Booklet{EasyChair:12579,
  author = {Rama Garimella},
  title = {Integer Factorization Is Not in P: Logical Proof},
  howpublished = {EasyChair Preprint no. 12579},

  year = {EasyChair, 2024}}