Fast Parallel Arithmetic via Modular Representation

DOI10.1137/0220048zbMath0736.68040OpenAlexW2007736689MaRDI QIDQ3978178

George Davida, Bruce Litow

Publication date: 25 June 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0220048

zbMATH Keywords

comparisonparallelismmodularcircuitdivisionalmost uniformcombinational

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (11)

Uniform constant-depth threshold circuits for division and iterated multiplication. ⋮ Bits and relative order from residues, space efficiently ⋮ The dynamic complexity of transitive closure is in DynTC\(^{0}\). ⋮ Binary coded unary regular languages ⋮ Census algorithms for chinese remainder pseudorank ⋮ On iterated integer product ⋮ Division in logspace-uniformNC¹ ⋮ Factoring and Testing Primes in Small Space ⋮ Fast arithmetics using Chinese remaindering ⋮ Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) ⋮ On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits

This page was built for publication: Fast Parallel Arithmetic via Modular Representation