Complexity of implementation of parity functions in the implication–negation basis

DOI10.1515/DMA-2015-0021zbMath1347.94078OpenAlexW2520783283MaRDI QIDQ2820943

Yu. A. Kombarov

Publication date: 13 September 2016

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

Full work available at URL: https://doi.org/10.1515/dma-2015-0021

zbMATH Keywords

circuitparity functionminimal circuitcomplexity circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

This page was built for publication: Complexity of implementation of parity functions in the implication–negation basis