Efficient parallel circuits and algorithms for division

DOI10.1016/0020-0190(88)90230-XzbMath0662.68034MaRDI QIDQ1114393

Vijaya Ramachandran, Narayan Shankar

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

circuit complexityefficient computationdivisionPRAM algorithmparallel circuitsboolean circuit

Mathematics Subject Classification ID

Related Items (3)

Uniform constant-depth threshold circuits for division and iterated multiplication. ⋮ Multiplication, division, and shift instructions in parallel random access machines ⋮ A parametric error analysis of Goldschmidt's division algorithm

Cites Work

• On uniform circuit complexity
• Fast multiplication of large numbers
• Constant Depth Reducibility
• Logarithmic Depth Circuits for Algebraic Functions
• Log Depth Circuits for Division and Related Problems
• Parallel Prefix Computation
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Majority Gate Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient parallel circuits and algorithms for division