Computing Powers in Parallel

DOI10.1137/0216060zbMath0636.68034MaRDI QIDQ3776614

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 computation; parallel processing; algebraic computing; arithmetic circuits; boolean circuits; powers of integers and polynoials

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W30: Symbolic computation and algebraic computation

11T06: Polynomials over finite fields

11A63: Radix representation; digital problems

Related Items

Parallel modular exponentiation using load balancing without precomputation, Efficient and optimal exponentiation in finite fields, A div(n) depth Boolean circuit for smooth modular inverse, 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, Modular exponentiation via the explicit Chinese remainder theorem