W. Eberly. Very fast polynomial arithmetic. SIAM Journal on Computing 18(5):955-976,October 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Uniform Constant-Depth Threshold Circuits for Division and.. - Hesse, Allender (2002) (1 citation) (Correct)
....of Polynomials .Polynomial Interpolation (also known as Cauchy interpolation) Hermite Interpolation of Polynomials .Computing bits of log X , X 1 k , and any other problem efficiently computed using power series approximations. Proof. The first three of these problems are shown in [28] to be FO reducible to Iterated Multiplication. Eberly claimed only NC reducibility, but his reductions are easily seen to be computable in DLOGTIME uniform AC . The corresponding reduction for Hermite interpolation can be found in [29] For background on approximating power series in ....
Wayne Eberly. Very fast polynomial arithmetic. SIAM Journal on Computing 18(5):955-976, October 1989.
Uniform Constant-Depth Threshold Circuits for Division and .. - Hesse, Allender, al. (2002) (1 citation) (Correct)
No context found.
W. Eberly. Very fast polynomial arithmetic. SIAM Journal on Computing 18(5):955-976,October 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC