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