2000 character limit reached
A Formalisation of a Fast Fourier Transform (2210.05225v4)
Published 11 Oct 2022 in cs.LO
Abstract: This notes explains how a standard algorithm that constructs the discrete Fourier transform has been formalised and proved correct in the Coq proof assistant using the SSReflect extension.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.