Pages that link to "Item:Q3140018"
From MaRDI portal
The following pages link to Constant depth circuits, Fourier transform, and learnability (Q3140018):
Displayed 45 items.
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- The Fourier spectrum of critical percolation (Q617882) (← links)
- Learning random monotone DNF (Q628302) (← links)
- Existence and efficient construction of fast Fourier transforms on supersolvable groups (Q685713) (← 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)
- 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)
- Bounds on the Fourier coefficients of the weighted sum function (Q2379949) (← links)
- Learning juntas in the presence of noise (Q2382279) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Fourier analysis and large independent sets in powers of complete graphs (Q2464160) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates (Q3012933) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- The learnability of quantum states (Q3508097) (← links)
- Decision Trees and Influences of Variables Over Product Probability Spaces (Q3557496) (← links)
- Testing monotone high‐dimensional distributions (Q3608311) (← links)
- Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
- Ehrenfeucht-Fraïssé Games on Random Structures (Q3638295) (← links)
- Average-Case Lower Bounds for Noisy Boolean Decision Trees (Q4210156) (← links)
- On the nonlinearity of the sequence of signs of Kloosterman sums (Q5315950) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
- Hardness amplification within NP (Q5917544) (← links)
- Learning a circuit by injecting values (Q5920703) (← links)
- Noise sensitivity of Boolean functions and applications to percolation (Q5932371) (← links)