Pages that link to "Item:Q4371686"
From MaRDI portal
The following pages link to On the Fourier spectrum of monotone functions (Q4371686):
Displaying 30 items.
- Improved approximation of linear threshold functions (Q371200) (← links)
- On the Fourier-Walsh spectrum of the Moebius function (Q375771) (← links)
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- Learning random monotone DNF (Q628302) (← links)
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913) (← links)
- On learning monotone Boolean functions under the uniform distribution (Q817825) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- The learnability of exclusive-or expansions based on monotone DNF formulas (Q1575458) (← links)
- On the nonlinearity of monotone Boolean functions (Q1667447) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- The difficulty of Monte Carlo approximation of multivariate monotone functions (Q1734615) (← links)
- On learning monotone DNF under product distributions (Q1881232) (← links)
- Monotone Boolean functions capture their primes (Q2253712) (← links)
- Inferring Boolean functions via higher-order correlations (Q2259702) (← links)
- Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- Parameterized Learnability of k-Juntas and Related Problems (Q3520054) (← links)
- Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles (Q3557533) (← links)
- (Q4638079) (← links)
- Agnostically Learning Boolean Functions with Finite Polynomial Representation (Q5136248) (← links)
- The Decomposition Tree for analyses of Boolean functions (Q5458074) (← links)
- Hardness amplification within NP (Q5917544) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions (Q6125778) (← links)
