scientific article; zbMATH DE number 3205680
From MaRDI portal
Publication:5333608
zbMath0126.32605MaRDI QIDQ5333608
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Complexity of realization by formulas of special form for functions of multivalued logic ⋮ Depth of functions of \(k\)-valued logic in finite bases ⋮ On some measures of complexity of finite abelian groups ⋮ On the computation complexity of the systems of finite abelian group elements ⋮ Lower bounds on the area complexity of Boolean circuits ⋮ Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen ⋮ A sequence of complexly computable functions ⋮ Characteristic measures of switching functions ⋮ The complexity of pseudo-linear functions ⋮ Complexity of functions from some classes of three-valued logic ⋮ Determination of systems of graphs and the synthesis of finite automata ⋮ Berechnungen in partiellen Algebren endlichen Typs ⋮ Average time of computing Boolean operators
