Efficient algorithms for sparse cyclotomic integer zero testing
From MaRDI portal
Publication:2268346
DOI10.1007/s00224-008-9158-2zbMath1183.68720OpenAlexW2058603023MaRDI QIDQ2268346
Qi Cheng, Sergey P. Tarasov, Mikhail N. 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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New NP-hard and NP-complete polynomial and integer divisibility problems
- An uncertainty principle for cyclic groups of prime order
- On vanishing sums of roots of unity.
- Hilbert's Nullstellensatz is in the polynomial hierarchy
- Natürliche Basen des Kreisteilungskörpers. I
- Irreducibility and greatest common divisor algorithms for sparse polynomials
- An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity
- Minimal vanishing sums of roots of unity with large coefficients
- On the Complexity of Numerical Analysis
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Identification of algebraic numbers
- Trigonometric diophantine equations (On vanishing sums of roots of unity)
- On testing the divisibility of lacunary polynomials by cyclotomic polynomials
- Reducing Randomness via Irrational Numbers
- A note on the cyclotomic polynomial
- Ein Beitrag zum Problem der Faktorisation von endlichen Abelschen Gruppen
