Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths (Q2074348)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths |
scientific article; zbMATH DE number 7471556
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths |
scientific article; zbMATH DE number 7471556 |
Statements
Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths (English)
0 references
9 February 2022
0 references
adder circuits
0 references
and-or paths
0 references
depth optimization
0 references
0 references
0 references
0.8465148210525513
0 references
0.8134210109710693
0 references
0.7734438180923462
0 references
0.7696086764335632
0 references
0.7684323191642761
0 references
