Implementation complexity of Boolean functions with a small number of ones

DOI10.1515/DMA-2021-0024MaRDI QIDQ2050236zbMATH OpenOpenAlexFDO

Authors Nikolay P. Red'kin

Publication date 30 August 2021

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

Full work available at URL https://doi.org/10.1515/dma-2021-0024

zbMATH Keywords

Boolean functionShannon functionBoolean circuit

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Boolean functions (94D10)

Recommendations

• Asymptotics for the complexity of Boolean functions with small number of ones
• On the complexity of Boolean functions with small number of ones
• Publication:4888933
• On the multiplicative complexity of Boolean functions
• The generalized complexity of linear Boolean functions

Cites work

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

Cited in

(3)

• On the complexity of Boolean functions with small number of ones
• Complexity of sequential implementation of partial Boolean functions
• Asymptotics for the complexity of Boolean functions with small number of ones

This page was built for publication: Implementation complexity of Boolean functions with a small number of ones

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