Shallow circuits and concise formulae for multiple addition and multiplication
type: Item
instance of: scholarly article
title: Shallow circuits and concise formulae for multiple addition and multiplication
zbMATH Open document ID: 0801.68092
DOI: 10.1007/BF01271371
author: Uri Zwick
author: Michael S. Paterson
published in: Computational Complexity
publication date: 1994-11-29T00:00:00Z
Mathematics Subject Classification ID: 68W35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 488273
zbMATH Keywords: multiplication
zbMATH Keywords: carry-save addition
zbMATH Keywords: circuits
zbMATH Keywords: formulae
zbMATH Keywords: Boolean functions
MaRDI profile type: Publication
cites work: On the Addition of Binary Numbers
cites work: Q4385519
cites work: Q3994882
cites work: $\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas
cites work: Q5629239
cites work: Q5844986
cites work: Q4133554
cites work: Q4036708
cites work: Majority Gate Networks
full work available at URL: https://doi.org/10.1007/bf01271371
OpenAlex ID: W2094817392
Recommended article: Formal Methods in Computer-Aided Design
Recommended article: Q4636586
Recommended article: Optimal circuits for parallel multipliers
Recommended article: Q4583790
Recommended article: Arithmetic and Algebraic Circuits
Recommended article: Q3115628
Recommended article: Simplification of logical functions with application to circuits
Recommended article: Constant integer multiplication using minimum adders
Recommended article: Circuit Complexity and Multiplicative Complexity of Boolean Functions
Recommended article: Multilevel reverse-carry addition: Single and dual adders
description: scientific article; zbMATH DE number 488273