The following pages link to (Q3142416):
Displayed 28 items.
- Quadratization of symmetric pseudo-Boolean functions (Q260013) (← links)
- Sign-representation of Boolean functions using a small number of monomials (Q280399) (← links)
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- Generalization error bounds for the logical analysis of data (Q427877) (← links)
- A geometric connection to threshold logic via cubical lattices (Q646706) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- On the coverings of the \(d\)-cube for \(d\leq 6\) (Q1003460) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- Classification by polynomial surfaces (Q1897355) (← links)
- On the cut number problem for the 4, and 5-cubes (Q1983113) (← links)
- Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity (Q2012049) (← links)
- Combined weight and density bounds on the polynomial threshold function representation of Boolean functions (Q2142651) (← links)
- Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
- On XOR lemmas for the weight of polynomial threshold functions (Q2280318) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- Extremal properties of polynomial threshold functions (Q2475403) (← links)
- Degree-uniform lower bound on the weights of polynomials with given sign function (Q2510769) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic (Q3439143) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors (Q5025767) (← links)
- When Does a Mixture of Products Contain a Product of Mixtures? (Q5251565) (← links)
- Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions (Q5380309) (← links)
- On neuronal capacity (Q5854113) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
- New degree bounds for polynomial threshold functions (Q5894427) (← links)