Complexity and structure of circuits for parity functions

DOI10.1007/S10958-018-3926-6zbMath1397.94132OpenAlexW2810743740MaRDI QIDQ1791765

Yu. A. Kombarov

Publication date: 11 October 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-018-3926-6

Mathematics Subject Classification ID

Cites Work

• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• Complexity of linear and majority functions in the basis of antichain functions
• 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: Complexity and structure of circuits for parity functions