Exact value of the nonmonotone complexity of Boolean functions
From MaRDI portal
circuit complexityinversion complexitycircuits of functional elementsnonmonotone complexityBoolean (logical) circuits
Recommendations
- On the positive and the inversion complexity of Boolean functions
- On the complexity of realization of the linear function by formulas over finite Boolean bases
- Limiting negations in non-deterministic circuits
- scientific article; zbMATH DE number 3970686
- The minimum number of negations in circuits for systems of multi-valued functions
Cites work
- scientific article; zbMATH DE number 3130282 (Why is no real title available?)
- scientific article; zbMATH DE number 3513337 (Why is no real title available?)
- scientific article; zbMATH DE number 3607492 (Why is no real title available?)
- scientific article; zbMATH DE number 3273218 (Why is no real title available?)
- scientific article; zbMATH DE number 3319974 (Why is no real title available?)
- Boolean function complexity. Advances and frontiers.
- Learning circuits with few negations
- 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
- The power of negations in cryptography
Cited in
(5)- Limiting negations in non-deterministic circuits
- Construction of noniterated Boolean functions in the basis \(\{\& ,\vee ,-\}\) and estimation of their number
- 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
- Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions
This page was built for publication: Exact value of the nonmonotone complexity of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2313604)
