Efficient parallel circuits and algorithms for division

DOI10.1016/0020-0190(88)90230-XMaRDI QIDQ1114393zbMATH OpenFDO

Authors Narayan Shankar, Vijaya Ramachandran

Publication date 1988

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

Full work available at URL https://doi.org/10.1016/0020-0190(88)90230-X

zbMATH Keywords

boolean circuitcircuit complexitydivisionefficient computationparallel circuitsPRAM algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Review text

We improve the size bound for parallel circuits and algorithms for the division problem.

Cites work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Constant Depth Reducibility
• Fast multiplication of large numbers
• scientific article; zbMATH DE number 3960996 (Why is no real title available?)
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3566175 (Why is no real title available?)
• scientific article; zbMATH DE number 3214539 (Why is no real title available?)
• scientific article; zbMATH DE number 3365225 (Why is no real title available?)
• Log Depth Circuits for Division and Related Problems
• Logarithmic Depth Circuits for Algebraic Functions
• Majority Gate Networks
• On uniform circuit complexity
• Parallel Prefix Computation

Cited in

(4)

• Multiplication, division, and shift instructions in parallel random access machines
• A parametric error analysis of Goldschmidt's division algorithm
• Uniform constant-depth threshold circuits for division and iterated multiplication.
• Efficient algorithmic decomposition of transistor groups into series, bridge, and parallel combinations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114393)