scientific article; zbMATH DE number 3319974
From MaRDI portal
Publication:5600476
zbMath0201.48701MaRDI QIDQ5600476
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
On various nonlinearity measures for Boolean functions ⋮ Asymptotically best synthesis methods for reflexive-recursive circuits ⋮ Alternation, sparsity and sensitivity: bounds and exponential gaps ⋮ On the Complexity of Multivalued Logic Functions over Some Infinite Basis ⋮ Asymptotics of growth for non-monotone complexity of multi-valued logic function systems ⋮ Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions ⋮ Multiplicative complexity of vector valued Boolean functions ⋮ Orders of growth of Shannon functions for circuit complexity over infinite bases ⋮ ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS ⋮ A generalization of Shannon function ⋮ The minimum number of negations in circuits for systems of multi-valued functions ⋮ Small low-depth circuits for cryptographic applications ⋮ On the mystery of negations in circuits: structure vs power ⋮ Asymptotic behavior of Shannon functions for the delays of schemes of functional elements ⋮ Negation-limited formulas ⋮ Ways of synthesizing binary programs admitting recursive call of procedures ⋮ Exact value of the nonmonotone complexity of Boolean functions ⋮ Some properties of Shannon functions ⋮ Asymptotically best method for synthesis of Boolean recursive circuits ⋮ On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates ⋮ On the multiplicative complexity of some Boolean functions ⋮ On the multiplicative complexity of quasi-quadratic Boolean functions
This page was built for publication:
