The complexity of the standard multiplexer function in a class of switching circuits

DOI10.1007/S10598-022-09547-0OpenAlexW4229067163MaRDI QIDQ2095998

Yanyan Li

Publication date: 16 November 2022

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10598-022-09547-0

zbMATH Keywords

complexitysynthesismultiplexer functionswitching circuits

Mathematics Subject Classification ID

Real functions (26-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 3n-lower bound on the network complexity of Boolean functions
• Asymptotically Optimal Circuit for a Storage Access Function
• A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions

This page was built for publication: The complexity of the standard multiplexer function in a class of switching circuits