Efficient parallel circuits and algorithms for division
type: Item
instance of: scholarly article
title: Efficient parallel circuits and algorithms for division
zbMATH Open document ID: 0662.68034
DOI: 10.1016/0020-0190(88)90230-X
author: Narayan Shankar
author: Vijaya Ramachandran
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
review text: We improve the size bound for parallel circuits and algorithms for the division problem.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4082965
zbMATH Keywords: circuit complexity
zbMATH Keywords: boolean circuit
zbMATH Keywords: PRAM algorithm
zbMATH Keywords: efficient computation
zbMATH Keywords: parallel circuits
zbMATH Keywords: division
MaRDI profile type: Publication
cites work: Q4065051
cites work: Log Depth Circuits for Division and Related Problems
cites work: Constant Depth Reducibility
cites work: Q5638290
cites work: An Algorithm for the Machine Calculation of Complex Fourier Series
cites work: Parallel Prefix Computation
cites work: Q3730020
cites work: Q5341755
cites work: Logarithmic Depth Circuits for Algebraic Functions
cites work: On uniform circuit complexity
cites work: Q4138141
cites work: Fast multiplication of large numbers
cites work: Majority Gate Networks
description: scientific article; zbMATH DE number 4082965