By Topic

Derandomization of Sparse Cyclotomic Integer Zero Testing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Qi Cheng ; Univ. of Oklahoma Norman, Norman

The zero testing and sign determination problems of real algebraic numbers of high extension degree are important in computational complexity and numerical analysis. In this paper we concentrate an sparse cyclotomic integers. Given an integer n and a sparse polynomial f(x) = Ckxe(k) + ck-1xe(k-1) + ... + c1xe(1)over Z, we present a deterministic polynomial time algorithm to decide whether f(wn) is zero or not, where f(wn) denotes the n-th primitive root of unity e2piradic(-1/n). All previously known algorithms are either randomized, or do not run in polynomial time. As a side result, we prove that if n is free of prime factors less than k + 1, there exist k field automorphisms sigma1, sigma2, ... , sigmak in the Galois group Gal (Q(wn)/Q) such that for any nonzero integers c1, c2 ... , ck and for any integers 0 les e1 < e2 < ... < ek < n, there exists i so that |sigmai(ckwn ek + ck-1wn e(k-1) + ... + c1wn e(1)) | ges 1/2(k(2)log n+klogk).

Published in:

Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on

Date of Conference:

21-23 Oct. 2007