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

parallel computationarithmetic circuitsparallel processingalgebraic computingboolean circuitspowers of integers and polynoials

Mathematics Subject Classification ID

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

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)

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

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)