Computing Powers in Parallel
From MaRDI portal
Publication:3776614
DOI10.1137/0216060zbMath0636.68034OpenAlexW2169202969MaRDI QIDQ3776614
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
parallel computationparallel processingalgebraic computingarithmetic circuitsboolean circuitspowers of integers and polynoials
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Radix representation; digital problems (11A63)
Related Items
Oracle computations in parallel numerical linear algebra, Inversion in finite fields using logarithmic depth, Boolean circuits versus arithmetic circuits, Generalized polar varieties: geometry and algorithms, The iterated mod problem, Parallel modular exponentiation using load balancing without precomputation, Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems, Highly parallel computations modulo a number having only small prime factors, Efficient and optimal exponentiation in finite fields, Modular exponentiation via the explicit Chinese remainder theorem, A div(n) depth Boolean circuit for smooth modular inverse
