Recommendations
Cites work
- A lower bound for testing juntas
- Algorithmic Aspects of Property Testing in the Dense Graphs Model
- Algorithmic Aspects of Property Testing in the Dense Graphs Model
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- scientific article; zbMATH DE number 2079374 (Why is no real title available?)
- scientific article; zbMATH DE number 742944 (Why is no real title available?)
- scientific article; zbMATH DE number 1453048 (Why is no real title available?)
- Improved Bounds for Testing Juntas
- Learning functions of \(k\) relevant variables
- Learning in the presence of finitely or infinitely many irrelevant attributes
- Linearity testing in characteristic two
- On the Benefits of Adaptivity in Property Testing of Dense Graphs
- Property testing and its connection to learning and approximation
- Quantum algorithms for learning and testing juntas
- Quantum lower bounds by polynomials
- Query-efficient dictatorship testing with perfect completeness
- Selection of relevant features and examples in machine learning
- Self-testing/correcting with applications to numerical problems
- Testing Basic Boolean Formulae
- Testing by implicit learning: a brief survey
- Testing juntas
- Testing juntas nearly optimally
- The jackknife estimate of variance
Cited in
(5)
This page was built for publication: Testing juntas: a brief survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933362)
