On bounds for complexity of circuits of multi-input functional elements

DOI10.1515/DMA.2010.005zbMATH Open1194.94210MaRDI QIDQ3586261FDOQ3586261

Authors Nikolay P. Red'kin

Publication date 6 September 2010

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Boolean functions (94D10) Networks and circuits as models of computation; circuit complexity (68Q06)

Recommendations

• scientific article; zbMATH DE number 2123419
• Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
• scientific article; zbMATH DE number 3937108
• scientific article; zbMATH DE number 4170847
• Refined bounds on Shannon's function for complexity of circuits of functional elements

Cited in

(16)

• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• scientific article; zbMATH DE number 4189653 (Why is no real title available?)
• Multiple-level circuit solutions to the circuit non-decomposability problem of the set-theoretic modified reconstructability analysis (MRA)
• scientific article; zbMATH DE number 2123419 (Why is no real title available?)
• Bounds for code length for circuits of functional elements
• scientific article; zbMATH DE number 4170847 (Why is no real title available?)
• scientific article; zbMATH DE number 4061152 (Why is no real title available?)
• On the complexity of implementation of characteristic functions of the spheres by circuits of functional elements
• scientific article; zbMATH DE number 3887074 (Why is no real title available?)
• Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing
• On the Complexity of Input/Output Logic
• On circuits of functional elements of finite depth of branching
• Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
• scientific article; zbMATH DE number 3937108 (Why is no real title available?)
• Multifunctional Circuits in Functional Canonical Form
• Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements

This page was built for publication: On bounds for complexity of circuits of multi-input functional elements

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