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

DOI10.3103/S0027132215050083zbMATH Open1371.94702OpenAlexW2271990076MaRDI QIDQ255774FDOQ255774

Authors: 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

Recommendations

• Lower bound of circuit complexity of parity function in a basis of unbounded fan-in
• Complexity and structure of circuits for parity functions
• Complexity of implementation of parity functions in the ``implication-negation basis
• Complexity of linear and majority functions in the basis of antichain functions
• The complexity of the parity function in unbounded fan-in, unbounded depth circuits

Mathematics Subject Classification ID

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

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
• On minimal realizations of linear Boolean functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• Lower bound of circuit complexity of parity function in a basis of unbounded fan-in
• Complexity and structure of circuits for parity functions
• Complexity of linear and majority functions in the basis of antichain functions
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255774)