Asymptotically best method for synthesis of Boolean recursive circuits

DOI10.1515/dma-2020-0013zbMath1465.94150OpenAlexW3031222762MaRDI QIDQ783110

Sergey A. Lozhkin, Vladimir V. Zhukov

Publication date: 30 July 2020

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

Full work available at URL: https://doi.org/10.1515/dma-2020-0013

zbMATH Keywords

asymptotic estimatesShannon functioncomplexity of Boolean functionsrecursive circuits of gates

Mathematics Subject Classification ID

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

Related Items (1)

Ways of synthesizing binary programs admitting recursive call of procedures

Cites Work

• Complexity of Boolean functions over bases with unbounded fan-in gates
• The asymptotically best method for synthesizing limited-depth Boolean recursive schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotically best method for synthesis of Boolean recursive circuits