W. Eberly. Logarithmic depth circuits for Hermite interpolation. J. Algorithms, 16(3):335--360, 1994. 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)
....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 TC , consult [49, 45] Working in the area of proof theory, Johannsen augmented the bounded arithmetic theory 2 (which is closely related to FOM) with a function symbol for integer division, to obtain a class he called C 2 [div] The ....
Wayne Eberly. Logarithmic depth circuits for Hermite interpolation. J. Algorithms, 16(3):335--360, 1994.
Uniform Constant-Depth Threshold Circuits for Division and .. - Hesse, Allender, al. (2002) (1 citation) (Correct)
No context found.
W. Eberly. Logarithmic depth circuits for Hermite interpolation. J. Algorithms, 16(3):335--360, 1994.
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