Fooling Polytopes (Q5066946): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q239418 / rank
Normal rank
 
Property / author
 
Property / author: Rocco A. Servedio / 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.1145/3460532 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210243870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic Independence Can Fool DNF Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth approximations of the norm and differentiable functions with bounded support in Banach space \(\ell ^ k_{\infty}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning an intersection of a constant number of halfspaces over a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial bound in Freiman's theorem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and efficient pseudorandom generators from gaussian processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Independence Fools Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of Measure for the Analysis of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a lemma of Littlewood and Offord / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Littlewood-Offord problem in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness via the Discrete Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNF sparsification and a faster deterministic counting algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An invariance principle for polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Entropic Proof of Chang's Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for network algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and lower bounds for de morgan formulas of low-communication leaf gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Small PRG for Polynomial Threshold Functions of Gaussians / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average sensitivity of an intersection of half spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5121890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Dimension Reduction and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of learning intersections of two halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning intersections and thresholds of halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hardness for learning intersections of halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Optimal Pseudorandom Generators for Spherical Caps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5839995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Littlewood's estimate for the binomial distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators for Polynomial Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom bits for constant depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness is linear in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / 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: The Chow Parameters Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fooling polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimates of the Moments of Sums of Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Proof of Bazzi’s Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the subspaces of \(L^p\) \((p > 2)\) spanned by sequences of independent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every linear threshold function has a low-weight approximator / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Circuit Classes Can Be Learned with Non-Trivial Savings? / 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: Optimal bounds for sign-representing the intersection of two halfspaces by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: How much are increasing sets positively correlated? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random-sampling-based algorithm for learning intersections of halfspaces / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:05, 28 July 2024

scientific article; zbMATH DE number 7500715
Language Label Description Also known as
English
Fooling Polytopes
scientific article; zbMATH DE number 7500715

    Statements

    Fooling Polytopes (English)
    0 references
    0 references
    0 references
    0 references
    31 March 2022
    0 references
    polytopes
    0 references
    pseudorandom generators
    0 references
    Littlewood-Offord
    0 references
    central limit theorems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers