frpoly Fourier transform algorithms collection to multiply two polynomials in O(n*logn) time. Written in C++20. Currently implemented: FFT in complex numbers. Note: pch.hpp defines _USE_MATH_DEFINES macro. Note: a bit wacky makefile (been doing it in Windows). Credits: Emaxx Algorithmica IFMO (russian) CF blog