scientific article; zbMATH DE number 3422273
From MaRDI portal
Publication:5684582
Cited in
(10)- Linear lower bounds on unbounded fan-in Boolean circuits
- Models of lower-bounds proofs
- A generalization of Shannon function
- Implementation complexity of Boolean functions with a small number of ones
- On the complexity of implementation of characteristic functions of the spheres by circuits of functional elements
- Lower bound of circuit complexity of parity function in a basis of unbounded fan-in
- Minimal contact circuits for symmetric threshold functions
- The generalized complexity of linear Boolean functions
- The minimal circuits for linear Boolean functions
- Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements
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 Q5684582)
