scientific article; zbMATH DE number 3873237

MaRDI QIDQ3340780zbMATH OpenFDO

Authors Nikolay P. Red'kin

Publication date 1981

zbMATH Keywords

binary addercomplexityminimalityn-bit parallel adder

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(16)

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

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)