On XOR lemmas for the weight of polynomial threshold functions (Q2280318): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2019.104439 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2019.104439 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2969420622 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124916951 / 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: Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds on the Average PTF Density of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harmonic Analysis of Polynomial Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning intersections and thresholds of halfspaces / 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: Unconditional lower bounds for learning intersections of halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Intersection of Two Halfspaces Has High Threshold Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}<sup>n</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal properties of polynomial threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142416 / 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: Threshold circuits of bounded depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting a weak learning algorithm by majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tensor Powers of Integer Programs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2019.104439 / rank
 
Normal rank

Latest revision as of 19:28, 17 December 2024

scientific article
Language Label Description Also known as
English
On XOR lemmas for the weight of polynomial threshold functions
scientific article

    Statements

    On XOR lemmas for the weight of polynomial threshold functions (English)
    0 references
    0 references
    0 references
    18 December 2019
    0 references
    computational complexity
    0 references
    Boolean functions
    0 references
    PTF
    0 references
    integer programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references