Refined bounds on Shannon's function for complexity of circuits of functional elements

DOI10.3103/S002713222203007XOpenAlexW4293752863MaRDI QIDQ2088739

Yanyan Li

Publication date: 6 October 2022

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s002713222203007x

zbMATH Keywords

complexityBoolean functioncircuits of functional elementshigh accuracy asymptotic bounds

Mathematics Subject Classification ID

Theory of computing (68Qxx) Circuits, networks (94Cxx) Boolean algebras (Boolean rings) (06Exx)

Cites Work

• On the synthesis and complexity of formulae with bounded depth of alternation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Refined bounds on Shannon's function for complexity of circuits of functional elements