Pages that link to "Item:Q4307054"

The following pages link to On the Size of Weights for Threshold Gates (Q4307054):

Displaying 27 items.

• On the number of irreducible points in polyhedra (Q343724) (← links)
• A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
• Improved approximation of linear threshold functions (Q371200) (← links)
• Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
• The communication complexity of addition (Q519955) (← links)
• On the constructive characterization of threshold functions (Q548758) (← links)
• Vectors in a box (Q715080) (← links)
• Perceptrons of large weight (Q734289) (← links)
• Monotone circuits for monotone weighted threshold functions (Q1044746) (← links)
• Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs (Q1369687) (← links)
• A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
• Monotone Boolean formulas can approximate monotone linear threshold functions (Q1878411) (← links)
• The hardest halfspace (Q1983325) (← links)
• Combined weight and density bounds on the polynomial threshold function representation of Boolean functions (Q2142651) (← links)
• Trading transforms of non-weighted simple games and integer weights of weighted simple games (Q2157830) (← links)
• A linear relation between input and first layer in neural networks (Q2294577) (← links)
• On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
• The inverse Shapley value problem (Q2411521) (← links)
• Patience of matrix games (Q2444536) (← links)
• Degree-uniform lower bound on the weights of polynomials with given sign function (Q2510769) (← links)
• A Better Upper Bound on Weights of Exact Threshold Functions (Q3010394) (← links)
• Quantum matchgate computations and linear threshold gates (Q3076715) (← links)
• Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
• (Q4612486) (← links)
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
• Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors (Q5025767) (← links)
• Weights of exact threshold functions (Q5033984) (← links)