A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Computing Rational Radical Sums in Uniform TC^0
Foundations of Software Technology and Theoretical Computer Science
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 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 TC 0 . This requires several significant departures from Blömer's polynomial-timedoi:10.4230/lipics.fsttcs.2010.308 dblp:conf/fsttcs/HunterBMOW10 fatcat:gh4nhqjhn5b3xnakwplb5uzjgy