Asymptotically best synthesis methods for reflexive-recursive circuits

DOI10.1007/S10598-020-09498-4zbMATH Open1460.94093OpenAlexW3094628681MaRDI QIDQ830987FDOQ830987

Authors: 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

Recommendations

• Asymptotically best method for synthesis of Boolean recursive circuits
• The asymptotically best method for synthesizing limited-depth Boolean recursive schemes
• High-accuracy asymptotic bounds for predicate circuits over a class of specific predicate bases
• Refined bounds on Shannon's function for complexity of circuits of functional elements
• scientific article; zbMATH DE number 2099460

zbMATH Keywords

Shannon functionasymptotic boundscomplexity of Boolean functionsrecursive circuits of functional elements

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of Boolean functions over bases with unbounded fan-in gates
• Title not available (Why is that?)
• On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
• Energy-efficient circuit design
• Title not available (Why is that?)
• New bounds for energy complexity of Boolean functions

Cited In (4)

• Title not available (Why is that?)
• Ways of synthesizing binary programs admitting recursive call of procedures
• Asymptotically best method for synthesis of Boolean recursive circuits
• The asymptotically best method for synthesizing limited-depth Boolean recursive schemes

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

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