Abstract
The AKS algorithm (by Agrawal, Kayal and Saxena) is a significant theoretical result proving “PRIMES in P”, as well as a brilliant application of ideas from finite fields. This paper describes the first step towards the goal of a full mechanisation of this result: a mechanization of the AKS Main Theorem, which justifies the correctness (but not the complexity) of the AKS algorithm.
Cite
CITATION STYLE
Chan, H. L., & Norrish, M. (2015). Mechanisation of AKS algorithm: Part 1 – The main theorem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9236, pp. 117–136). Springer Verlag. https://doi.org/10.1007/978-3-319-22102-1_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
