A case study of number-theoretic computation: Searching for primes in arithmetic progression

DOI10.1016/0167-6423(83)90003-5MaRDI QIDQ1055463zbMATH OpenOpenAlexFDO

Authors Paul A. Pritchard

Publication date 1983

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/6344

zbMATH Keywords

asymptotic complexitydesign of algorithmsprimes in arithmetic progression

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Arithmetic progressions (11B25) Primes in congruence classes (11N13) Analysis of algorithms and problem complexity (68Q25)

Cited in

(1)

• Twenty-Two Primes in Arithmetic Progression

This page was built for publication: A case study of number-theoretic computation: Searching for primes in arithmetic progression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1055463)