Estimating the efficiency of threshold representations of Boolean functions

DOI10.1007/BF01079143MaRDI QIDQ4005316zbMATH OpenFDO

Authors L. I. Lipkin, Yu. A. Zuev

Publication date 26 September 1992

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

monotone Boolean functionsrepresentation of Boolean functionssystems of linear inequalities

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 3877103
• scientific article; zbMATH DE number 850396
• On the number of threshold functions
• scientific article; zbMATH DE number 822063
• The best asymptotic representation of Boolean functions by information graphs

Cites work

• scientific article; zbMATH DE number 3877103 (Why is no real title available?)
• scientific article; zbMATH DE number 4202198 (Why is no real title available?)
• scientific article; zbMATH DE number 3825713 (Why is no real title available?)
• scientific article; zbMATH DE number 3916176 (Why is no real title available?)
• scientific article; zbMATH DE number 3961508 (Why is no real title available?)
• scientific article; zbMATH DE number 4027364 (Why is no real title available?)
• scientific article; zbMATH DE number 4045648 (Why is no real title available?)
• scientific article; zbMATH DE number 194333 (Why is no real title available?)
• scientific article; zbMATH DE number 3214054 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• On defining sets of vertices of the hypercube by linear inequalities
• Representations of Boolean functions by systems of linear inequalities
• Threshold Numbers and Threshold Completions

Cited in

(6)

• On data classification by iterative linear partitioning
• On the efficiency of normal form systems for representing Boolean functions
• Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large n
• Nearest neighbor representations of Boolean functions
• A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment
• The best asymptotic representation of Boolean functions by information graphs

This page was built for publication: Estimating the efficiency of threshold representations of Boolean functions

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