Efficient algorithms for sparse cyclotomic integer zero testing

DOI10.1007/S00224-008-9158-2zbMATH Open1183.68720OpenAlexW2058603023MaRDI QIDQ2268346FDOQ2268346

Authors: Qi Cheng, Sergey P. Tarasov, Mikhail Vyalyi 

Publication date: 5 March 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9158-2

Recommendations

• An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity
• Computing the torsion points of a variety defined by lacunary polynomials
• On testing the divisibility of lacunary polynomials by cyclotomic polynomials
• Testing polynomials
• Efficiently detecting torsion points and subtori

zbMATH Keywords

algorithmsparse representationcyclotomic polynomialroot of unity

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• An uncertainty principle for cyclic groups of prime order
• On vanishing sums of roots of unity.
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Trigonometric diophantine equations (On vanishing sums of roots of unity)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the cyclotomic polynomial
• Ein Beitrag zum Problem der Faktorisation von endlichen Abelschen Gruppen
• Title not available (Why is that?)
• On the Complexity of Numerical Analysis
• New NP-hard and NP-complete polynomial and integer divisibility problems
• Minimal vanishing sums of roots of unity with large coefficients
• Reducing Randomness via Irrational Numbers
• Hilbert's Nullstellensatz is in the polynomial hierarchy
• Natürliche Basen des Kreisteilungskörpers. I
• Identification of algebraic numbers
• On testing the divisibility of lacunary polynomials by cyclotomic polynomials
• An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity
• Irreducibility and greatest common divisor algorithms for sparse polynomials
• Title not available (Why is that?)

Cited In (5)

• An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity
• Testing degenerate polynomials
• Computing the torsion points of a variety defined by lacunary polynomials
• Efficiently detecting torsion points and subtori
• Cyclotomic identity testing and applications

This page was built for publication: Efficient algorithms for sparse cyclotomic integer zero testing

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