On the positive and the inversion complexity of Boolean functions
From MaRDI portal
Recommendations
- On the multiplicative complexity of Boolean functions
- On the complexity of restrictions of Boolean functions
- On the multiplicative complexity of some Boolean functions
- On the complexity of reducing weakly positive and weakly negative Boolean functions
- scientific article; zbMATH DE number 176868
- Complexity of identification and dualization of positive Boolean functions
- On the complexity of balanced Boolean functions
- On complexity of a particular Boolean functions class
- scientific article; zbMATH DE number 4108153
- scientific article; zbMATH DE number 4035741
Cites work
- scientific article; zbMATH DE number 176507 (Why is no real title available?)
- scientific article; zbMATH DE number 3358351 (Why is no real title available?)
- scientific article; zbMATH DE number 3419055 (Why is no real title available?)
- On the Inversion Complexity of a System of Functions
- The complexity of the parity function in unbounded fan-in, unbounded depth circuits
Cited in
(10)- The minimum number of negations in circuits for systems of multi-valued functions
- Exact value of the nonmonotone complexity of Boolean functions
- On the Inversion Complexity of a System of Functions
- scientific article; zbMATH DE number 1205991 (Why is no real title available?)
- On the complexity of reducing weakly positive and weakly negative Boolean functions
- About some properties of Horn and anti-Horn functions
- scientific article; zbMATH DE number 6415494 (Why is no real title available?)
- Topological aspects of Boolean functions
- On the computation of Boolean functions by analog circuits of bounded fan-in
- Limiting negations in non-deterministic circuits
This page was built for publication: On the positive and the inversion complexity of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142263)
