Asymptotics for the complexity of Boolean functions with small number of ones

DOI10.1134/S0001434621010296zbMath1495.94173OpenAlexW3180378932MaRDI QIDQ2037657

Nikolay P. Red'kin

Publication date: 8 July 2021

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434621010296

zbMATH Keywords

circuitBoolean functioncomplexity of a function

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Cites Work

• On the complexity of Boolean functions with small number of ones
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotics for the complexity of Boolean functions with small number of ones