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)

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
• Refined bounds on Shannon's function for complexity of circuits of functional elements

Mathematics Subject Classification ID

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

Cited In (12)

• Title not available (Why is that?)
• On circuits of functional elements of finite depth of branching
• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• Title not available (Why is that?)
• Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
• Title not available (Why is that?)
• Multiple-level circuit solutions to the circuit non-decomposability problem of the set-theoretic modified reconstructability analysis (MRA)
• On the Complexity of Input/Output Logic
• Title not available (Why is that?)
• Multifunctional Circuits in Functional Canonical Form
• Title not available (Why is that?)
• Title not available (Why is that?)

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)