Algorithmic Number Theory

DOI10.1007/11792086zbMath1143.11360OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899252

Kjell Wooding, Hugh C. Williams

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11792086

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Primality (11Y11)

Related Items

On pseudopoints of algebraic curves ⋮ Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures ⋮ Improved Primality Proving with Eisenstein Pseudocubes ⋮ Two algorithms to find primes in patterns