An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}n
From MaRDI portal
Publication:3421386
DOI10.1162/neco.2006.18.12.3119zbMath1107.68082WikidataQ48392353 ScholiaQ48392353MaRDI QIDQ3421386
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
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions, Sign-representation of Boolean functions using a small number of monomials, The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks, 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