The shortest disjunctive normal form of a random Boolean function

DOI10.1002/RSA.10065MaRDI QIDQ4800394zbMATH OpenOpenAlexFDO

Authors Nicholas Pippenger

Publication date 3 April 2003

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.10065

zbMATH Keywords

disjunctive normal formaverage lengthrandom Boolean function

Mathematics Subject Classification ID

Boolean functions (06E30)

Cites work

• scientific article; zbMATH DE number 4152425 (Why is no real title available?)
• Near perfect coverings in graphs and hypergraphs
• On a packing and covering problem

Cited in

(6)

• Approximating Boolean functions with depth-2 circuits
• Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms
• scientific article; zbMATH DE number 4010400 (Why is no real title available?)
• scientific article; zbMATH DE number 3916176 (Why is no real title available?)
• On the minimization of Boolean functions for additive complexity measures
• scientific article; zbMATH DE number 3877187 (Why is no real title available?)

This page was built for publication: The shortest disjunctive normal form of a random Boolean function

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