Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements

DOI10.3103/S0027132215050083zbMath1371.94702OpenAlexW2271990076MaRDI QIDQ255774

Yu. A. Kombarov

Publication date: 9 March 2016

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

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

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
• Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements