scientific article; zbMATH DE number 176877
From MaRDI portal
Publication:4036708
[For the entire collection see Zbl 0754.00019.] Using any given carry save adder, the authors develop a method to construct carry save networks such that for the carry save addition of \(n\) numbers the asymptotically shallowest networks and the asymptotically smallest networks result. The shallowest multiplication circuits and the shortest formula for the majority function are obtained using the carry save networks.
Recommendations
Cited in
(15)- Shallow circuits and concise formulae for multiple addition and multiplication
- \(\Sigma\Pi\Sigma\) threshold formulas
- Better lower bounds for monotone threshold formulas
- Formula complexity of a linear function in a \(k\)-ary basis
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
- Complexity and depth of formulas for symmetric Boolean functions
- Complexity of computation in finite fields
- A Way to Build Efficient Carry-Skip Adders
- A stronger LP bound for formula size lower bounds via clique constraints
- Carry-save multiplication schemes without final addition
- Upper bounds for the formula size of symmetric Boolean functions
- scientific article; zbMATH DE number 1882357 (Why is no real title available?)
- Exploring the limits of subadditive approaches: parallels between optimization and complexity theory
- Multiplication
- On the meaning of works by V. M. Khrapchenko
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036708)
