scientific article; zbMATH DE number 3513337
From MaRDI portal
Publication:4092993
zbMATH Open0327.68055MaRDI QIDQ4092993FDOQ4092993
Authors: Michael Fischer 
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (17)
- Limiting negations in non-deterministic circuits
- On the minimum number of negations leading to super-polynomial savings
- An exponential gap with the removal of one negation gate
- On the mystery of negations in circuits: structure vs power
- On the negation-limited circuit complexity of merging
- Negation-limited formulas
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS
- Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences
- On Negations in Boolean Networks
- On negation complexity of injections, surjections and collision-resistance in cryptography
- Negation can be exponentially powerful
- 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
- The minimum number of negations in circuits for systems of multi-valued functions
- Negation-limited circuit complexity of symmetric functions
- Exact value of the nonmonotone complexity of Boolean functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4092993)
