Bounded Independence Fools Halfspaces
From MaRDI portal
Recommendations
- Bounded Independence Fools Halfspaces
- Bounded independence vs. moduli
- Around -independence
- Bounded independence plus noise fools products
- Bounded independence plus noise fools products
- scientific article; zbMATH DE number 4111312
- Independence, measure and pseudofinite fields
- The independence of the continuum hypothesis
- A relative bound for independence
- Continuous Independence and the Ilieff-Sendov Conjecture
Cited in
(32)- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace
- Bounded indistinguishability and the complexity of recovering secrets
- A dichotomy for local small-bias generators
- Cryptographic hardness of random local functions. Survey
- On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace
- Making the Long Code Shorter
- Polylogarithmic independence can fool DNF formulas
- Improved approximation of linear threshold functions
- Pseudorandom generators for combinatorial checkerboards
- Pseudorandomness via the discrete Fourier transform
- Average-case lower bounds and satisfiability algorithms for small threshold circuits
- Bounded independence plus noise fools products
- Quantified Derandomization: How to Find Water in the Ocean
- Approximate Degree in Classical and Quantum Computing
- Fooling Polytopes
- Polynomial data structure lower bounds in the group model
- Simple and efficient pseudorandom generators from gaussian processes
- Bounded independence plus noise fools products
- On the power of statistical zero knowledge
- scientific article; zbMATH DE number 7250142 (Why is no real title available?)
- Sampling lower bounds: Boolean average-case and permutations
- Weighted polynomial approximations: limits for learning and pseudorandomness
- An invariance principle for polytopes
- Concentration and moment inequalities for polynomials of independent random variables
- Paradigms for Unconditional Pseudorandom Generators
- Polynomial approximation on disjoint segments and amplification of approximation
- Depth-\(d\) threshold circuits vs. depth-\((d+1)\) and-or trees
- A moment-matching approach to testable learning and a new characterization of Rademacher complexity
- Pseudorandomness, symmetry, smoothing: I
- Robustly learning mixtures of k arbitrary Gaussians
- Approximation of \(\operatorname{sgn} (x)\) on two symmetric intervals by rational functions with fixed poles
This page was built for publication: Bounded Independence Fools Halfspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5390601)
