Testing juntas: a brief survey
From MaRDI portal
Publication:4933362
DOI10.1007/978-3-642-16367-8_4zbMATH Open1308.68148OpenAlexW1479783912MaRDI QIDQ4933362FDOQ4933362
Authors: Eric Blais 
Publication date: 12 October 2010
Published in: Property Testing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16367-8_4
Recommendations
Cites Work
- Selection of relevant features and examples in machine learning
- The jackknife estimate of variance
- Property testing and its connection to learning and approximation
- Self-testing/correcting with applications to numerical problems
- Linearity testing in characteristic two
- Learning functions of \(k\) relevant variables
- Learning in the presence of finitely or infinitely many irrelevant attributes
- Title not available (Why is that?)
- Quantum lower bounds by polynomials
- Testing juntas nearly optimally
- Testing juntas
- A lower bound for testing juntas
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Testing Basic Boolean Formulae
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved Bounds for Testing Juntas
- Testing by implicit learning: a brief survey
- Quantum algorithms for learning and testing juntas
- On the Benefits of Adaptivity in Property Testing of Dense Graphs
- Algorithmic Aspects of Property Testing in the Dense Graphs Model
- Query-efficient dictatorship testing with perfect completeness
- Algorithmic Aspects of Property Testing in the Dense Graphs Model
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)
