Relationships between the number of inputs and other complexity measures of Boolean functions

DOI10.19086/DA.57741MaRDI QIDQ6939808zbMATH OpenFDO

Authors Jake L. Wellens

Publication date 20 August 2025

Published in Discrete Analysis (Search for Journal in Brave)

zbMATH Keywords

complexity measuresBoolean functions

Mathematics Subject Classification ID

Boolean functions (06E30) Networks and circuits as models of computation; circuit complexity (68Q06)

This page was built for publication: Relationships between the number of inputs and other complexity measures of Boolean functions

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