Pages that link to "Item:Q3140018"
From MaRDI portal
The following pages link to Constant depth circuits, Fourier transform, and learnability (Q3140018):
Displaying 50 items.
- Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials (Q285507) (← links)
- The average sensitivity of bounded-depth circuits (Q290255) (← links)
- Pseudo-average block sensitivity equals average sensitivity (Q293418) (← links)
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Computing Walsh coefficients from the algebraic normal form of a Boolean function (Q458740) (← links)
- Isomorphism testing of Boolean functions computable by constant-depth circuits (Q476155) (← links)
- Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity (Q510482) (← links)
- Local restrictions from the Furst-Saxe-Sipser paper (Q519884) (← links)
- The communication complexity of addition (Q519955) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- The Fourier spectrum of critical percolation (Q617882) (← links)
- Learning random monotone DNF (Q628302) (← links)
- Learning Boolean functions in \(AC^0\)on attribute and classification noise -- estimating an upper bound on attribute and classification noise (Q638534) (← links)
- Existence and efficient construction of fast Fourier transforms on supersolvable groups (Q685713) (← links)
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Spatio-spectral limiting on Boolean cubes (Q829900) (← links)
- On the measure of intersecting families, uniqueness and stability (Q963246) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- Learning large-alphabet and analog circuits with value injection queries (Q1009264) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Learning with restricted focus of attention (Q1271613) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Probability set functions (Q1306737) (← links)
- Toward efficient agnostic learning (Q1342730) (← links)
- On the degree of Boolean functions as real polynomials (Q1346612) (← links)
- Reflections on ``Representations of sets of Boolean functions by commutative rings'' by Roman Smolensky (Q1377573) (← links)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- Approximate location of relevant variables under the crossover distribution. (Q1422405) (← links)
- A slight sharpening of LMN (Q1604204) (← links)
- Boolean functions: influence, threshold and noise (Q1620841) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- On automorphic analogues of the Möbius randomness principle (Q1634427) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Noise stability and correlation with half spaces (Q1748919) (← links)
- Exploring learnability between exact and PAC (Q1780447) (← 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)
- Uniform-distribution attribute noise learnability (Q1877555) (← links)
- On learning monotone DNF under product distributions (Q1881232) (← links)
- Learning functions of \(k\) relevant variables (Q1886314) (← links)
- Polynomial regression under arbitrary product distributions (Q1959600) (← links)
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (Q1978498) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Separation results for Boolean function classes (Q2119852) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- On the Fourier transform of a quantitative trait: implications for compressive sensing (Q2137407) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
