scientific article; zbMATH DE number 3404149
From MaRDI portal
Publication:5670543
Cited in
(5)- Upper bounds for the formula size of symmetric Boolean functions
- Complexity and structure of near-minimal contact circuits for elementary symmetric functions
- The complexity of the realization of symmetrical functions by formulae
- Efficient oblivious branching programs for threshold and mod functions
- On implementation of some systems of elementary conjunctions in the class of separating contact circuits
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 Q5670543)
