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

dc.contributor.author	Andersson, Jesper
dc.contributor.author	Lideström, Åsa
dc.contributor.author	Oom, Daniel
dc.contributor.author	Sjöberg, Anders
dc.contributor.author	Ståhl, Niclas
dc.contributor.department	Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)	sv
dc.contributor.department	Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)	en
dc.date.accessioned	2019-07-03T13:31:34Z
dc.date.available	2019-07-03T13:31:34Z
dc.date.issued	2014
dc.description.abstract	Computer-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.identifier.uri	https://hdl.handle.net/20.500.12380/203645
dc.language.iso	swe
dc.setspec.uppsok	Technology
dc.subject	Data- och informationsvetenskap
dc.subject	Computer and Information Science
dc.title	Formalisering av algoritmer och matematiska bevis En formalisering av Toom-Cook algoritmen i Coq med SSReflect
dc.type.degree	Examensarbete för kandidatexamen	sv
dc.type.degree	Bachelor Thesis	en
dc.type.uppsok	M2
local.programme	Datateknik 300 hp (civilingenjör)

Visar 1 - 1 av 1