Computing Rational Radical Sums in Uniform TC^0
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of deciding whether $\sum_{i=1}^m C_i A_i^{X_i}$ is zero for given rational numbers $A_i$, $C_i$, $X_i$. It has been known for almost twenty years that this can be decided in polynomial time. In this paper we improve this result by showing membership in uniform TC0. This requires several significant departures from Blömer's polynomial-time algorithm as the latter crucially relies on primitives, such as gcd computation and binary search, that are not known to be in TC0.
Sum of square roots
Threshold circuits
Complexity
308-316
Regular Paper
Paul
Hunter
Paul Hunter
Patricia
Bouyer
Patricia Bouyer
Nicolas
Markey
Nicolas Markey
Joël
Ouaknine
Joël Ouaknine
James
Worrell
James Worrell
10.4230/LIPIcs.FSTTCS.2010.308
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode