scientific article; zbMATH DE number 3513337
From MaRDI portal
zbMath0327.68055MaRDI QIDQ4092993
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Limiting negations in non-deterministic circuits, On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography, On the Complexity of Multivalued Logic Functions over Some Infinite Basis, Limiting negations in bounded-depth circuits: an extension of Markov's theorem, Asymptotics of growth for non-monotone complexity of multi-valued logic function systems, Negation can be exponentially powerful, ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS, Negation-limited circuit complexity of symmetric functions, The minimum number of negations in circuits for systems of multi-valued functions, On the mystery of negations in circuits: structure vs power, Negation-limited formulas, Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences, On Negations in Boolean Networks, Exact value of the nonmonotone complexity of Boolean functions, On the minimum number of negations leading to super-polynomial savings, On the negation-limited circuit complexity of merging, An exponential gap with the removal of one negation gate
