Fast Parallel Arithmetic via Modular Representation
From MaRDI portal
Recommendations
Cited in
(26)- On iterated integer product
- Fast and parallel interval arithmetic
- Bits and relative order from residues, space efficiently
- Parallel evaluation of arithmetic circuits
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Accelerated tower arithmetic
- Division in logspace-uniform NC
- scientific article; zbMATH DE number 5799780 (Why is no real title available?)
- Optimal Size Integer Division Circuits
- Census algorithms for chinese remainder pseudorank
- High-Performance Modular Multiplication on the Cell Processor
- Factoring and Testing Primes in Small Space
- Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
- Parallel modular exponentiation using load balancing without precomputation
- Parallel modular multiplication with table look-up
- A practical parallel algorithm for computinga b modc *
- Interpolating Arithmetic Read-Once Formulas in Parallel
- Tabular minimal redundant modular structures for fast and high-precision computations using general-purpose computers
- Topics in Cryptology – CT-RSA 2004
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\)
- Binary coded unary regular languages
- Binary coded unary regular languages
- A div(n) depth Boolean circuit for smooth modular inverse
- Fast arithmetics using Chinese remaindering
This page was built for publication: Fast Parallel Arithmetic via Modular Representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978178)
