The following pages link to Computing Powers in Parallel (Q3776614):
Displayed 11 items.
- Parallel modular exponentiation using load balancing without precomputation (Q414922) (← links)
- Efficient and optimal exponentiation in finite fields (Q685709) (← links)
- A div(n) depth Boolean circuit for smooth modular inverse (Q808255) (← links)
- The iterated mod problem (Q1119390) (← links)
- Highly parallel computations modulo a number having only small prime factors (Q1184734) (← links)
- Oracle computations in parallel numerical linear algebra (Q1325837) (← links)
- Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
- Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)