Upper bounds on the depth of symmetric Boolean functions

DOI10.3103/S0278641913040080zbMath1353.94094OpenAlexW2027522969MaRDI QIDQ264012

Igor S. Sergeev

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

zbMATH Keywords

depthmultiplicationimplementationsymmetric Boolean functionsBoolean circuitsmajority function

Mathematics Subject Classification ID

Boolean functions (06E30)

Related Items (3)

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

• New upper bounds on the Boolean circuit complexity of symmetric functions
• Shallow circuits and concise formulae for multiple addition and multiplication

This page was built for publication: Upper bounds on the depth of symmetric Boolean functions