Asymptotically best synthesis methods for reflexive-recursive circuits

DOI10.1007/s10598-020-09498-4zbMath1460.94093OpenAlexW3094628681MaRDI QIDQ830987

N. E. Zubov

Publication date: 10 May 2021

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10598-020-09498-4

zbMATH Keywords

asymptotic boundsShannon functioncomplexity of Boolean functionsrecursive circuits of functional elements

Mathematics Subject Classification ID

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

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
• On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
• Energy-efficient circuit design
• New bounds for energy complexity of Boolean functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotically best synthesis methods for reflexive-recursive circuits