Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions

DOI10.1162/NECO_a_00750zbMath1435.68223WikidataQ48126333 ScholiaQ48126333MaRDI QIDQ5380309

Erhan Oztop, Can Eren Sezener

Publication date: 4 June 2019

Published in: Neural Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (2)

Combined weight and density bounds on the polynomial threshold function representation of Boolean functions ⋮ On XOR lemmas for the weight of polynomial threshold functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sign-representation of Boolean functions using a small number of monomials
• On ``bent functions
• Polynomial Threshold Functions and Boolean Threshold Circuits
• New Upper Bounds on the Average PTF Density of Boolean Functions
• Variable Elimination in Linear Constraints
• An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}ⁿ
• Harmonic Analysis of Polynomial Threshold Functions
• The Application of the Rademacher–Walsh Transform to Boolean Function Classification and Threshold Logic Synthesis
• Information Processing in Dendritic Trees
• On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach
• A Classification of the Cosets of the Reed-Muller Code R (1, 6)
• Weight distributions of the cosets of the (32,6) Reed-Muller code

This page was built for publication: Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions