Abstract
We present two deterministic polynomial time algorithms for the following problem: check whether a sparse polynomial f(x) vanishes at a given primitive nth root of unity ζ n . A priori f(ζ n ) may be nonzero and doubly exponentially small in the input size. The existence of a polynomial time procedure in the case of factored n was conjectured by D. Plaisted in 1984, but all previously known algorithms are either randomized, or do not run in polynomial time. We apply polynomial zero testing algorithms to construct a nondeterministic polynomial time algorithm for the torsion point problem (TP). The problem TP is a particular case of the feasibility problem for a system of polynomial equations in complex numbers (coefficients of polynomials are integers). In the problem TP all coordinates of a solution must be roots of unity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.