Asymptotically best synthesis methods for reflexive-recursive circuits
From MaRDI portal
Publication:830987
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
Cites work
- scientific article; zbMATH DE number 5529977 (Why is no real title available?)
- scientific article; zbMATH DE number 609988 (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?)
- scientific article; zbMATH DE number 3187230 (Why is no real title available?)
- Complexity of Boolean functions over bases with unbounded fan-in gates
- Energy-efficient circuit design
- New bounds for energy complexity of Boolean functions
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
Cited in
(4)- Ways of synthesizing binary programs admitting recursive call of procedures
- The asymptotically best method for synthesizing limited-depth Boolean recursive schemes
- Asymptotically best method for synthesis of Boolean recursive circuits
- scientific article; zbMATH DE number 3186297 (Why is no real title available?)
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)