Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model
From MaRDI portal
Publication:6548992
Recommendations
Cites work
- A model of computation for VLSI with related complexity results
- scientific article; zbMATH DE number 3644978 (Why is no real title available?)
- scientific article; zbMATH DE number 4176981 (Why is no real title available?)
- scientific article; zbMATH DE number 5529977 (Why is no real title available?)
- scientific article; zbMATH DE number 2032366 (Why is no real title available?)
- scientific article; zbMATH DE number 2123423 (Why is no real title available?)
- scientific article; zbMATH DE number 3323861 (Why is no real title available?)
- Lower bounds on the area complexity of Boolean circuits
- On a basis for schemes consisting of cellular elements
- On the activity of cell circuits realising the system of all conjunctions
- On the complexity of realization of the universal function by circuits of functional elements
- Order of power of planar circuits implementing Boolean functions
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)