Pages that link to "Item:Q280399"
From MaRDI portal
The following pages link to Sign-representation of Boolean functions using a small number of monomials (Q280399):
Displaying 3 items.
- 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)
- Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions (Q5380309) (← links)
