An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity

DOI10.1007/978-3-540-74510-5_40zbMath1188.68160OpenAlexW1529054308MaRDI QIDQ3499789

Sergey P. Tarasov, Mikhail N. Vyalyi

Publication date: 3 June 2008

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74510-5_40

zbMATH Keywords

algorithmroot of unitysparse representationcyclotomic polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

Efficient algorithms for sparse cyclotomic integer zero testing

This page was built for publication: An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity