Conference icon

Conference

Computing Rational Radical Sums in Uniform TC0

Abstract:

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 Σi=1m CiAiXi 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ömer's polynomial-time a...

Expand abstract
Publication status:
Published

Actions


Access Document


Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
Volume:
8
Pages:
308-316
Publication date:
2010-01-01
DOI:
ISSN:
1868-8969
URN:
uuid:19711a68-04d2-4c45-acec-309d224cd4c4
Source identifiers:
366518
Local pid:
pubs:366518
ISBN:
9783939897231

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP