Computing Powers in Parallel

DOI10.1137/0216060MaRDI QIDQ3776614zbMATH OpenOpenAlexFDO

Authors Joachim von zur Gathen

Publication date 1987

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

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

zbMATH Keywords

algebraic computingarithmetic circuitsboolean circuitsparallel computationparallel processingpowers of integers and polynoials

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Polynomials over finite fields (11T06) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 18647
• A practical parallel algorithm for computinga b modc *
• Publication:4207582
• Highly parallel computations modulo a number having only small prime factors
• Very Fast Parallel Polynomial Arithmetic

Cited in

(21)

• Bit serial addition trees and their applications
• The iterated mod problem
• Highly parallel computations modulo a number having only small prime factors
• Oracle computations in parallel numerical linear algebra
• Generalized polar varieties: geometry and algorithms
• Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems
• Inversion in finite fields using logarithmic depth
• Boolean circuits versus arithmetic circuits
• scientific article; zbMATH DE number 4129953 (Why is no real title available?)
• Modular exponentiation via the explicit Chinese remainder theorem
• Comparing Computational Power
• Very Fast Parallel Polynomial Arithmetic
• scientific article; zbMATH DE number 4062581 (Why is no real title available?)
• scientific article; zbMATH DE number 4085015 (Why is no real title available?)
• scientific article; zbMATH DE number 18647 (Why is no real title available?)
• Parallel modular exponentiation using load balancing without precomputation
• Improved Parallel Polynomial Division
• scientific article; zbMATH DE number 4128395 (Why is no real title available?)
• Modular technique of high-speed parallel computing on the sets of polynomials
• Efficient and optimal exponentiation in finite fields
• A div(n) depth Boolean circuit for smooth modular inverse

This page was built for publication: Computing Powers in Parallel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776614)