Formalisering av algoritmer och matematiska bevis En formalisering av Toom-Cook algoritmen i Coq med SSReflect

Examensarbete för kandidatexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/203645
Download file(s):
File Description SizeFormat 
203645.pdfFulltext886.37 kBAdobe PDFView/Open
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAndersson, Jesper
dc.contributor.authorLideström, Åsa
dc.contributor.authorOom, Daniel
dc.contributor.authorSjöberg, Anders
dc.contributor.authorStåhl, Niclas
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T13:31:34Z-
dc.date.available2019-07-03T13:31:34Z-
dc.date.issued2014
dc.identifier.urihttps://hdl.handle.net/20.500.12380/203645-
dc.description.abstractComputer-aided formalization of mathematics has progressed in the last decade with the formalization of very large and complex proofs such as the proof of the Four color theorem and the Feit-Thompson theorem. In this report we present a formal proof of the Toom-Cook algorithm using the Coq proof assistant together with the SSReflect extension. The Toom-Cook algorithm is used to multiply polynomials and can also be used for integer multiplication.
dc.language.isoswe
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titleFormalisering av algoritmer och matematiska bevis En formalisering av Toom-Cook algoritmen i Coq med SSReflect
dc.type.degreeExamensarbete för kandidatexamensv
dc.type.degreeBachelor Thesisen
dc.type.uppsokM2
Collection:Examensarbeten för kandidatexamen // Bachelor Theses



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