Circuit complexity of symmetric Boolean functions in antichain basis

DOI10.1515/dma-2016-0003zbMath1347.94081arXiv1410.2456OpenAlexW2340850974MaRDI QIDQ314174

Olga V. Podolskaya

Publication date: 13 September 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.2456

zbMATH Keywords

symmetric Boolean functionsShannon functionBoolean circuitsantichain functionsBoolean circuit complexity

Mathematics Subject Classification ID

Related Items (3)

Lower bound of circuit complexity of parity function in a basis of unbounded fan-in ⋮ Circuit complexity of symmetric Boolean functions in antichain basis ⋮ On the Complexity of Multivalued Logic Functions over Some Infinite Basis

Cites Work

• Circuit complexity of symmetric Boolean functions in antichain basis
• On the complexity of schemes in an infinite basis
• Unnamed Item

This page was built for publication: Circuit complexity of symmetric Boolean functions in antichain basis