Pages that link to "Item:Q5390601"
From MaRDI portal
The following pages link to Bounded Independence Fools Halfspaces (Q5390601):
Displaying 26 items.
- A dichotomy for local small-bias generators (Q315550) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Improved approximation of linear threshold functions (Q371200) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Approximation of \(\operatorname{sgn} (x)\) on two symmetric intervals by rational functions with fixed poles (Q902187) (← links)
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace (Q2410679) (← links)
- A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry (Q2808162) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Pseudorandom generators for polynomial threshold functions (Q2848221) (← links)
- Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces (Q3189646) (← links)
- On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace (Q3448804) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Fooling Polytopes (Q5066946) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- Simple and efficient pseudorandom generators from gaussian processes (Q5091754) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- (Q5121890) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- Concentration and Moment Inequalities for Polynomials of Independent Random Variables (Q5743410) (← links)
- Polynomial approximation on disjoint segments and amplification of approximation (Q6198118) (← links)
