Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A ONE LINE FACTORING ALGORITHM

From MaRDI portal
Publication:2898887
Jump to:navigation, search

DOI10.1017/S1446788712000146zbMath1251.11088MaRDI QIDQ2898887

William B. Hart

Publication date: 12 July 2012

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)


zbMATH Keywords

Fermat's algorithminteger factorization methodsLehman's algorithm


Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51) Factorization (11Y05)


Related Items

Efficient implementation of the Hardy–Ramanujan–Rademacher formula



Cites Work

  • Speeding Fermat’s factoring method
  • Square form factorization
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2898887&oldid=15854871"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki