Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model
From MaRDI portal
Publication:6548992
DOI10.1515/DMA-2024-0009zbMATH Open1545.94097MaRDI QIDQ6548992FDOQ6548992
Publication date: 3 June 2024
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- Lower bounds on the area complexity of Boolean circuits
- Title not available (Why is that?)
- A model of computation for VLSI with related complexity results
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Order of power of planar circuits implementing Boolean functions
- On a basis for schemes consisting of cellular elements
- On the activity of cell circuits realising the system of all conjunctions
- Title not available (Why is that?)
- On the complexity of realization of the universal function by circuits of functional elements
- Title not available (Why is that?)
This page was built for publication: Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548992)