Upper bounds on the depth of symmetric Boolean functions
From MaRDI portal
Publication:264012
DOI10.3103/S0278641913040080zbMath1353.94094OpenAlexW2027522969MaRDI QIDQ264012
Publication date: 5 April 2016
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s0278641913040080
Related Items
Complexity and depth of formulas for symmetric Boolean functions, Upper bounds for the size and the depth of formulae for MOD-functions, Unnamed Item
Cites Work