Proving Pearl: Knuth’s Algorithm for Prime Numbers

DOI10.1007/10930755_20zbMath1279.68298OpenAlexW1513780238MaRDI QIDQ3559771

Laurent Théry

Publication date: 7 May 2010

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

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

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Primes (11A41)

Related Items

Nine Chapters of Analytic Number Theory in Isabelle/HOL., Mechanisation of the AKS algorithm, About the Formalization of Some Results by Chebyshev in Number Theory

Uses Software

• Coq