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

DOI10.1134/S0001434621010296MaRDI QIDQ2037657zbMATH OpenOpenAlexFDO

Authors 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

Boolean functioncircuitcomplexity of a function

Mathematics Subject Classification ID

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

Recommendations

• Implementation complexity of Boolean functions with a small number of ones
• On the complexity of Boolean functions with small number of ones
• Asymptotically minimal schemes for one sequence of Boolean functions
• Comparative analysis of the complexity of Boolean functions with a small number of zeros
• scientific article; zbMATH DE number 4097290

Cites work

• scientific article; zbMATH DE number 3128653 (Why is no real title available?)
• scientific article; zbMATH DE number 5531170 (Why is no real title available?)
• scientific article; zbMATH DE number 3419054 (Why is no real title available?)
• On the complexity of Boolean functions with small number of ones

Cited in

(6)

• The class of 1-balanced functions and the complexity of its realization
• Implementation complexity of Boolean functions with a small number of ones
• On the complexity of Boolean functions with small number of ones
• Chair of Discrete Mathematics
• Asymptotically minimal schemes for one sequence of Boolean functions
• Asymptotics of the number of repetition-free Boolean functions in the elementary basis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037657)