Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model

DOI10.1515/DMA-2024-0009zbMATH Open1545.94097MaRDI QIDQ6548992FDOQ6548992

Authors: S. A. Lozhkin, Vadim S. Zizov 

Publication date: 3 June 2024

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

Recommendations

• On the asymptotics of the complexity of a universal cellular switching network
• The complexity of the standard multiplexer function in a class of switching circuits
• Publication:3197770
• On multiplexer function complexity in the \(\pi\)-schemes class
• On a class of cell circuits

zbMATH Keywords

Boolean circuitmultiplexervery large scale integrationplanar circuitcellular circuitlookup function

Mathematics Subject Classification ID

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)