An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}n

DOI10.1162/neco.2006.18.12.3119zbMath1107.68082OpenAlexW2164511197WikidataQ48392353 ScholiaQ48392353MaRDI QIDQ3421386

Erhan Oztop

Publication date: 12 February 2007

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

Full work available at URL: https://doi.org/10.1162/neco.2006.18.12.3119

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (5)

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 ⋮ The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks ⋮ Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions ⋮ On XOR lemmas for the weight of polynomial threshold functions

Cites Work

• On the Complexity of Computing and Learning with Multiplicative Neural Networks
• Variable Elimination in Linear Constraints
• Harmonic Analysis of Polynomial Threshold Functions
• Information Processing in Dendritic Trees
• On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach

This page was built for publication: An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}ⁿ