Perceptrons of large weight

DOI10.1134/S0032946009010062zbMath1171.68585OpenAlexW1988425761MaRDI QIDQ734289

Vladimir V. Podolskii

Publication date: 20 October 2009

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946009010062

Mathematics Subject Classification ID

Related Items (11)

Weights of exact threshold functions ⋮ Approximate Degree in Classical and Quantum Computing ⋮ A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting ⋮ A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Patience of matrix games ⋮ The communication complexity of addition ⋮ Degree-uniform lower bound on the weights of polynomials with given sign function ⋮ Unnamed Item ⋮ Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors

Cites Work

• Unnamed Item
• Unnamed Item
• Perceptrons, PP, and the polynomial hierarchy
• On the Size of Weights for Threshold Gates

This page was built for publication: Perceptrons of large weight