scientific article; zbMATH DE number 3873237

zbMATH Open0547.94017MaRDI QIDQ3340780FDOQ3340780

Authors: Nikolay P. Red'kin 

Publication date: 1981

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

Recommendations

• Parallel Binary Adders with a Minimum Number of Connections
• scientific article; zbMATH DE number 998407
• Publication:3033322
• Binary adder circuits of asymptotically minimum depth, linear size, and fan-out two
• scientific article; zbMATH DE number 3934407

zbMATH Keywords

complexityminimalitybinary addern-bit parallel adder

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cited In (15)

• New lower bounds on circuit size of multi-output functions
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• The minimal circuits for linear Boolean functions
• On half-adders based on fusion of signal carriers: excitation, fluidics, and electricity
• Parallel Binary Adders with a Minimum Number of Connections
• Arithmetic Addition over Boolean Masking
• Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
• Secure collaborative supply chain planning and inverse optimization -- the JELS model
• Multiplication
• The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear
• Two operand binary adders with threshold logic
• Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345
• Complexity of computation in finite fields
• A nonlinear lower bound on the practical combinational complexity
• A nonlinear lower bound on the practical combinational complexity

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 Q3340780)