Very Fast Parallel Polynomial Arithmetic

DOI10.1137/0218066zbMath0694.68029OpenAlexW2052788392MaRDI QIDQ3470109

Wayne Eberly

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0218066

zbMATH Keywords

interpolationparallel algorithmscircuit depthpolynomial divisionpolynomial arithmetic\(NC^ 1\)-reductioniterated integer product

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)

Related Items (18)

Uniform constant-depth threshold circuits for division and iterated multiplication. ⋮ Inversion in finite fields using logarithmic depth ⋮ Boolean circuits versus arithmetic circuits ⋮ On design of circuits of logarithmic depth for inversion in finite fields ⋮ Feasible arithmetic computations: Valiant's hypothesis ⋮ Matrix structures in parallel matrix computations ⋮ Complexity of computation in finite fields ⋮ Parallel Identity Testing for Skew Circuits with Big Powers and Applications ⋮ Knapsack and the power word problem in solvable Baumslag–Solitar groups ⋮ Evaluation of circuits over nilpotent and polycyclic groups ⋮ Finding a vector orthogonal to roughly half a collection of vectors ⋮ Unnamed Item ⋮ Parallel identity testing for skew circuits with big powers and applications ⋮ Functional decomposition of polynomials: the tame case ⋮ Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets ⋮ Resolution of Hartmanis' conjecture for NL-hard sparse sets ⋮ Threshold Circuits for Iterated Matrix Product and Powering ⋮ The enumerability of P collapses P to NC

This page was built for publication: Very Fast Parallel Polynomial Arithmetic