A decomposition of Boolean functions

DOI10.1515/DMA.2000.10.4.423zbMATH Open1002.94054OpenAlexW1998244657MaRDI QIDQ2708276

A. V. Chashkin

Publication date: 13 September 2001

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

Full work available at URL: https://doi.org/10.1515/dma.2000.10.4.423

zbMATH Keywords

circuit complexitydecompositions of Boolean functions

Mathematics Subject Classification ID

Boolean functions (06E30)

Related Items (7)

Separation results for Boolean function classes ⋮ The number of k‐SAT functions ⋮ Unnamed Item ⋮ Join-irreducible Boolean functions ⋮ Unnamed Item ⋮ Boolean functions with MacWilliams duality ⋮ Unnamed Item

This page was built for publication: A decomposition of Boolean functions