Minimal sign representation of Boolean functions: algorithms and exact results for low dimensions

DOI10.1162/NECO_A_00750MaRDI QIDQ5380309zbMATH OpenDBLPWikidataFDO

Authors Can Eren Sezener, Erhan Oztop

Publication date 4 June 2019

Published in Neural Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Analysis of algorithms (68W40) Neural biology (92C20) Boolean functions (06E30) Boolean functions (94D10)

Recommendations

• Sign-representation of Boolean functions using a small number of monomials
• Representation of Boolean functions by polynomial forms
• Combined weight and density bounds on the polynomial threshold function representation of Boolean functions
• Representations of Boolean functions
• On the number of significant variables of balanced Boolean function with the fixed number of elementary conjunctions in its DNF

Cites work

• scientific article; zbMATH DE number 5862915 (Why is no real title available?)
• scientific article; zbMATH DE number 446494 (Why is no real title available?)
• scientific article; zbMATH DE number 761425 (Why is no real title available?)
• scientific article; zbMATH DE number 4195884 (Why is no real title available?)
• A Classification of the Cosets of the Reed-Muller Code R (1, 6)
• An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}ⁿ
• Harmonic Analysis of Polynomial Threshold Functions
• Information Processing in Dendritic Trees
• New upper bounds on the average PTF density of Boolean functions
• On ``bent functions
• On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach
• Polynomial threshold functions and Boolean threshold circuits
• Sign-representation of Boolean functions using a small number of monomials
• The Application of the Rademacher–Walsh Transform to Boolean Function Classification and Threshold Logic Synthesis
• Variable Elimination in Linear Constraints
• Weight distributions of the cosets of the (32,6) Reed-Muller code

Cited in

(4)

• Sign-representation of Boolean functions using a small number of monomials
• Combined weight and density bounds on the polynomial threshold function representation of Boolean functions
• On XOR lemmas for the weight of polynomial threshold functions
• Nearest neighbor representations of Boolean functions

This page was built for publication: Minimal sign representation of Boolean functions: algorithms and exact results for low dimensions

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