scientific article; zbMATH DE number 176877

zbMATH Open0770.94010MaRDI QIDQ4036708FDOQ4036708

Authors: Michael S. Paterson, Uri Zwick, Nicholas Pippenger 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Shallow circuits and concise formulae for multiple addition and multiplication
• Some notes on threshold circuits, and multiplication in depth 4
• Carry-save multiplication schemes without final addition
• scientific article; zbMATH DE number 4057452
• Depth-size trade-offs for parallel prefix computation

zbMATH Keywords

complexitymajority functionmultiplication circuitscarry save addercarry save networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (15)

• Carry-save multiplication schemes without final addition
• Title not available (Why is that?)
• A Way to Build Efficient Carry-Skip Adders
• A stronger LP bound for formula size lower bounds via clique constraints
• Shallow circuits and concise formulae for multiple addition and multiplication
• Better lower bounds for monotone threshold formulas
• Formula complexity of a linear function in a \(k\)-ary basis
• Complexity and depth of formulas for symmetric Boolean functions
• Upper bounds for the formula size of symmetric Boolean functions
• \(\Sigma\Pi\Sigma\) threshold formulas
• Multiplication
• Exploring the limits of subadditive approaches: parallels between optimization and complexity theory
• Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
• Complexity of computation in finite fields
• 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)