The complexity of monotone boolean functions

DOI10.1007/BF01768483MaRDI QIDQ4138140zbMATH OpenFDO

Authors Nicholas Pippenger

Publication date 1978

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01768483

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3572044 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 3304025 (Why is no real title available?)
• Lattice Theoretic Properties of Frontal Switching Functions
• Logarithmic order of free distributive lattice
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• Relations Among Complexity Measures

Cited in

(5)

• Mining circuit lower bound proofs for meta-algorithms
• About complexity of implementing threshold functions
• On the complexity of 2-output Boolean networks
• A measure in which Boolean negation is exponentially powerful
• On the complexity of slice functions

This page was built for publication: The complexity of monotone boolean functions

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