A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating threshold circuits by rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational approximation techniques for analysis of neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of voting polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of depth-2 circuits with threshold and modulo gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New degree bounds for polynomial threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional lower bounds for learning intersections of halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning intersections and thresholds of halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perceptrons, PP, and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harmonic Analysis of Polynomial Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Threshold Circuits with Small Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority gates vs. general weighted threshold gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Boolean functions by polynomials and threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of Boolean decision lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of a threshold gate at the top / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Weights for Threshold Gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perceptrons of large weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Lower Bound on Weights of Perceptrons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold circuits of bounded depth / rank
 
Normal rank

Latest revision as of 21:52, 6 July 2024

scientific article
Language Label Description Also known as
English
A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
scientific article

    Statements

    A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (English)
    0 references
    18 September 2013
    0 references
    Boolean function
    0 references
    integer-valued polynomial
    0 references
    sign function
    0 references
    perceptron
    0 references
    Boolean circuit
    0 references
    complexity theory
    0 references
    discrete Fourier transform
    0 references
    exponential gap
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers