scientific article; zbMATH DE number 3273218
From MaRDI portal
Publication:5557960
Cited in
(11)- Non-cancellative Boolean circuits: a generalization of monotone Boolean circuits
- On the minimum number of negations leading to super-polynomial savings
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS
- On the complexity of multivalued logic functions over some infinite basis
- 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
- Lower bounds for constant-depth circuits in the presence of help bits
- Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions
- Exact value of the nonmonotone complexity of Boolean functions
- Circuit complexity of \(k\)-valued logic functions in one infinite basis
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 Q5557960)
