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 m i=1 CiAXi i is zero for given rational numbers Ai, Ci, Xi. It has been known for almost twenty years that this can be decided in polynomial time [2]. In this paper we improve this result by showing membership in uniform TC0 . This requires several significant departures from Bl

• Type: Journal
• Year: 2010
• Where: FSTTCS
• Authors: Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell
• Keywords: Complexity Digital Object, FSTTCS 2010, Fundamental Problem, Rational Numbers, Software Engineering