The following pages link to (Q4839061):
Displaying 31 items.
- Upper bounds on Fourier entropy (Q344776) (← links)
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← 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)
- Evolvability via the Fourier transform (Q690457) (← links)
- Maximizing agreements and coagnostic learning (Q817828) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Approximate location of relevant variables under the crossover distribution. (Q1422405) (← links)
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). (Q1811103) (← links)
- Circuit and decision tree complexity of some number theoretic problems (Q1854439) (← links)
- Learning functions of \(k\) relevant variables (Q1886314) (← links)
- A recursive procedure for density estimation on the binary hypercube (Q1951138) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Efficient quantum algorithms related to autocorrelation spectrum (Q2179405) (← links)
- Towards a proof of the Fourier-entropy conjecture? (Q2216459) (← links)
- The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (Q2224843) (← links)
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae (Q2331079) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- Bounds on the Fourier coefficients of the weighted sum function (Q2379949) (← links)
- Quantum algorithms for learning and testing juntas (Q2462663) (← links)
- The Multivariate Hidden Number Problem (Q2947535) (← links)
- The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions (Q3012817) (← links)
- (Q3191586) (← links)
- Representing Utility Functions via Weighted Goals (Q3392304) (← links)
- Boolean functions with small spectral norm, revisited (Q5234620) (← links)
- On learning thresholds of parities and unions of rectangles in random walk models (Q5433270) (← links)
- Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions (Q6125778) (← links)
