Asymptotically best method for synthesis of Boolean recursive circuits

DOI10.1515/DMA-2020-0013MaRDI QIDQ783110zbMATH OpenOpenAlexFDO

Authors Vladimir V. Zhukov, S. A. Lozhkin

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)

Recommendations

• The asymptotically best method for synthesizing limited-depth Boolean recursive schemes
• Asymptotically best synthesis methods for reflexive-recursive circuits
• Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference
• scientific article; zbMATH DE number 942481
• Asymptotically optimal Boolean functions
• scientific article; zbMATH DE number 850402
• Beating exhaustive search for quantified Boolean formulas and connections to circuit complexity
• Approximating Boolean functions with depth-2 circuits
• scientific article; zbMATH DE number 5906481
• Boolean functional synthesis: hardness and practical algorithms

Cites work

• scientific article; zbMATH DE number 5529977 (Why is no real title available?)
• scientific article; zbMATH DE number 3463540 (Why is no real title available?)
• scientific article; zbMATH DE number 2099460 (Why is no real title available?)
• scientific article; zbMATH DE number 3319974 (Why is no real title available?)
• Complexity of Boolean functions over bases with unbounded fan-in gates
• The asymptotically best method for synthesizing limited-depth Boolean recursive schemes

Cited in

(7)

• Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference
• scientific article; zbMATH DE number 2099460 (Why is no real title available?)
• Ways of synthesizing binary programs admitting recursive call of procedures
• Asymptotically best synthesis methods for reflexive-recursive circuits
• Synthesis of formulas whose depth and complexity do not exceed asymptotically the best estimates of high accuracy
• Lupanov's methods and their importance for the formation of circuit synthesis theory
• The asymptotically best method for synthesizing limited-depth Boolean recursive schemes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q783110)