Ways of synthesizing binary programs admitting recursive call of procedures

DOI10.3103/S0278641921030079zbMath1496.68121OpenAlexW3203050793MaRDI QIDQ2058706

Yanyan Li

Publication date: 9 December 2021

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641921030079

zbMATH Keywords

asymptotic estimatesShannon functionbinary programs

Mathematics Subject Classification ID

Boolean functions (06E30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cites Work

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

This page was built for publication: Ways of synthesizing binary programs admitting recursive call of procedures