Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
type: Item
instance of: scholarly article
title: Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
author: Ulrich Brenner
author: Anna Silvanus
author: Jannik Silvanus
published in: Discrete Applied Mathematics
publication date: 2022-02-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/2012.05550
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 94Cxx
Mathematics Subject Classification ID: 06Exx
zbMATH DE Number: 7471556
zbMATH Keywords: adder circuits
zbMATH Keywords: and-or paths
zbMATH Keywords: depth optimization
describes a project that uses: JBool
describes a project that uses: OEIS
MaRDI profile type: Publication
OpenAlex ID: W4220747421
cites work: Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times
cites work: On the Addition of Binary Numbers
cites work: Size-depth tradeoff in monotone Boolean formulae
cites work: Size-depth tradeoff in non-monotone Boolean formulae
cites work: Q5253278
cites work: Q3077976
cites work: Q3115681
cites work: Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two
cites work: Fast prefix adders for non-uniform input arrival times
cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth
cites work: Q5583472
cites work: Q3115631
cites work: A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
cites work: Parallel Prefix Computation
cites work: Q4036708
cites work: Delay optimization of linear depth Boolean circuits with prescribed input arrival times
cites work: The delay of circuits whose inputs have specified arrival times
cites work: Q4344138
cites work: Q4443440
cites work: Q3762226
DOI: 10.1016/J.DAM.2021.12.007
description: scientific article; zbMATH DE number 7471556