scientific article; zbMATH DE number 1966606
From MaRDI portal
Publication:4420740
zbMATH Open1024.68046MaRDI QIDQ4420740FDOQ4420740
Authors: Kazuyuki Amano, A. Maruoka 
Publication date: 18 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2533/25330057.htm
Title of this publication is not available (Why is that?)
Recommendations
- On learning monotone Boolean functions under the uniform distribution
- Learning Monotone Decision Trees in Polynomial Time
- On the Fourier spectrum of monotone functions
- Learning Monotone Boolean Functions by Uniformly Distributed Examples
- Boolean functions with low average sensitivity depend on few coordinates
Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32) Boolean functions (06E30)
Cited In (12)
- Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- Title not available (Why is that?)
- Aspects of complexity of probabilistic learning under monotonicity constraints
- Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity
- KKL, Kruskal-Katona, and monotone nets
- Learning k-Term Monotone Boolean Formulae.
- Lower bound on the correlation between monotone families in the average case
- Learning Monotone Decision Trees in Polynomial Time
- Learning random monotone DNF
- Exact learning Boolean functions via the monotone theory
- On learning monotone Boolean functions under the uniform distribution
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420740)
