scientific article; zbMATH DE number 3273218
From MaRDI portal
Publication:5557960
zbMath0171.27903MaRDI QIDQ5557960
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
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 ⋮ Lower bounds for constant-depth circuits in the presence of help bits ⋮ ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS ⋮ The minimum number of negations in circuits for systems of multi-valued functions ⋮ Exact value of the nonmonotone complexity of Boolean functions ⋮ On the minimum number of negations leading to super-polynomial savings ⋮ Non-cancellative Boolean circuits: A generalization of monotone boolean circuits ⋮ Circuit complexity of \(k\)-valued logic functions in one infinite basis
This page was built for publication:
