Upper bounds for the size and the depth of formulae for MOD-functions
From MaRDI portal
Publication:1675519
DOI10.1515/dma-2017-0003zbMath1422.94053OpenAlexW2599479773MaRDI QIDQ1675519
Publication date: 2 November 2017
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma-2017-0003
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Upper bounds on the depth of symmetric Boolean functions
- Upper bounds for the formula size of symmetric Boolean functions
- Boolean function complexity. Advances and frontiers.
- On the depth complexity of the counting functions
- A note on the formula size of the ``mod k functions
- Method of determining lower bounds for the complexity of \(\Pi\)-circuits
- $\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas
This page was built for publication: Upper bounds for the size and the depth of formulae for MOD-functions
