A lower bound on circuit complexity of vector function in U _2
From MaRDI portal
Publication:2907488
DOI10.1007/978-3-642-30642-6_8zbMATH Open1341.68055OpenAlexW229217171MaRDI QIDQ2907488FDOQ2907488
Authors: Evgeny Demenkov 
Publication date: 10 September 2012
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30642-6_8
Recommendations
- New lower bounds on circuit size of multi-output functions
- A \(5n - o(n)\) lower bound on the circuit size over \(U _{2}\) of a linear Boolean function
- A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions
- Explicit lower bound of 4.5n - o(n) for boolena circuits
- scientific article; zbMATH DE number 4061152
Cited In (5)
- New lower bounds on circuit size of multi-output functions
- A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds
- A \(5n - o(n)\) lower bound on the circuit size over \(U _{2}\) of a linear Boolean function
- On lower bounds for the complexity of vector systems of k-valued logic
- A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds
This page was built for publication: A lower bound on circuit complexity of vector function in \(U _{2}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907488)
