A case study of number-theoretic computation: Searching for primes in arithmetic progression
From MaRDI portal
Publication:1055463
DOI10.1016/0167-6423(83)90003-5zbMath0521.10002OpenAlexW2030684641MaRDI QIDQ1055463
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
Analysis of algorithms and problem complexity (68Q25) Primes in congruence classes (11N13) Software, source code, etc. for problems pertaining to number theory (11-04) Arithmetic progressions (11B25) Primes (11A41)
Related Items (1)
This page was built for publication: A case study of number-theoretic computation: Searching for primes in arithmetic progression
