The following pages link to Perceptrons of large weight (Q734289):
Displaying 11 items.
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- The communication complexity of addition (Q519955) (← links)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- Patience of matrix games (Q2444536) (← links)
- Degree-uniform lower bound on the weights of polynomials with given sign function (Q2510769) (← links)
- (Q5009530) (← links)
- (Q5009555) (← links)
- Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors (Q5025767) (← links)
- Weights of exact threshold functions (Q5033984) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5158501) (← links)
