Pages that link to "Item:Q3421386"
From MaRDI portal
The following pages link to An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}<sup>n</sup> (Q3421386):
Displaying 5 items.
- Sign-representation of Boolean functions using a small number of monomials (Q280399) (← links)
- The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks (Q439836) (← links)
- Combined weight and density bounds on the polynomial threshold function representation of Boolean functions (Q2142651) (← links)
- On XOR lemmas for the weight of polynomial threshold functions (Q2280318) (← links)
- Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions (Q5380309) (← links)
