Property testing. A learning theory perspective
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) General topics in artificial intelligence (68T01) Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)
Recommendations
Cited in
(24)- An adaptivity hierarchy theorem for property testing
- Testing shape restrictions of discrete distributions
- Non-interactive proofs of proximity
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity
- An optimal tester for \(k\)-linear
- An optimal tester for k-Linear
- Testing whether the uniform distribution is a stationary distribution
- scientific article; zbMATH DE number 1819631 (Why is no real title available?)
- Testing polymorphic properties
- Approximate membership for regular languages modulo the edit distance
- A local decision test for sparse polynomials
- Hierarchy theorems for property testing
- Testable and untestable classes of first-order formulae
- scientific article; zbMATH DE number 2156274 (Why is no real title available?)
- scientific article; zbMATH DE number 1857651 (Why is no real title available?)
- A brief introduction to property testing
- Testing by implicit learning: a brief survey
- A unified framework for testing linear-invariant properties
- Property testing. Problems and techniques
- Introduction to Property Testing
- On one-sided testing affine subspaces
- Efficiently testing sparse \(\text{GF}(2)\) polynomials
- (Quantum) complexity of testing signed graph clusterability
- Property testing lower bounds via communication complexity
This page was built for publication: Property testing. A learning theory perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615896)
