Skip navigation
Skip navigation

Mechanisation of AKS algorithm: Part 1 - The main theorem

Chan, Hing Lun (Joseph); Norrish, Michael

Description

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.

CollectionsANU Research Publications
Date published: 2015
Type: Conference paper
URI: http://hdl.handle.net/1885/103341
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-319-22102-1_8

Download

File Description SizeFormat Image
01_Chan_Mechanisation_of_AKS_2015.pdf390.26 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator