Root finding with threshold circuits

Abstract

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform family of constant-depth polynomial-size threshold circuits). The basic idea is to compute the inverse function of the polynomial by a power series. We also discuss an application to the theory VTC^0 of bounded arithmetic.

arXiv comment19 pages, 1 figure

Cited by in corpus (2)

• Open induction in a bounded arithmetic for TC^0
• On the complexity of the clone membership problem