scientific article

zbMath0547.94017MaRDI QIDQ3340780

Nikolay P. Red'kin

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityminimalitybinary addern-bit parallel adder

Mathematics Subject Classification ID

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

Related Items (10)

The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear ⋮ Complexity of computation in finite fields ⋮ Secure collaborative supply chain planning and inverse optimization -- the JELS model ⋮ Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables ⋮ Nonlinear lower bounds on the number of processors of circuits with sublinear separators ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ The minimal circuits for linear Boolean functions ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ Unnamed Item ⋮ New lower bounds on circuit size of multi-output functions

This page was built for publication: