Lower bound of circuit complexity of parity function in a basis of unbounded fan-in

DOI10.3103/S002713222106005XzbMath1497.94199OpenAlexW4226171997MaRDI QIDQ2131416

Yu. A. Kombarov

Publication date: 26 April 2022

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s002713222106005x

zbMATH Keywords

circuit complexityparity functionBoolean circuitsminimal circuit

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Cites Work

• Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements
• Circuit complexity of symmetric Boolean functions in antichain basis
• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bound of circuit complexity of parity function in a basis of unbounded fan-in