A fast recursive algorithm for computing cyclotomic polynomials

DOI10.1145/1940475.1940479MaRDI QIDQ5175237zbMATH OpenOpenAlexFDO

Authors Andrew Arnold, Michael Monagan

Publication date 20 February 2015

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1940475.1940479

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Cyclotomy (11T22) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

This page was built for publication: A fast recursive algorithm for computing cyclotomic polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175237)