The asymptotically best method for synthesizing limited-depth Boolean recursive schemes

DOI10.3103/S0278641917030086zbMath1388.94095OpenAlexW2751784132MaRDI QIDQ1706039

Peng Zhang

Publication date: 20 March 2018

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

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

zbMATH Keywords

asymptotic estimatescomplexity of Boolean functionsShannon's functionconjunctive decoderdisjunctive universal setrecursive schemes of functional elementssynthesizing schemes

Mathematics Subject Classification ID

Related Items (2)

Ways of synthesizing binary programs admitting recursive call of procedures ⋮ Asymptotically best method for synthesis of Boolean recursive circuits

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: The asymptotically best method for synthesizing limited-depth Boolean recursive schemes