A brief introduction to property testing
From MaRDI portal
Publication:4933359
Recommendations
Cites work
- A combinatorial characterization of the testable graph properties, it's all about regularity
- A sublinear bipartiteness tester for bounded degree graphs
- Algorithmic and analysis techniques in property testing
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Robust Characterizations of Polynomials with Applications to Program Testing
- Self-testing/correcting with applications to numerical problems
- Tolerant property testing and distance approximation
Cited in
(11)- scientific article; zbMATH DE number 2156274 (Why is no real title available?)
- Distributed Testing of Distance-k Colorings
- The program of the mini-workshop
- On one-sided testing affine subspaces
- Property testing. A learning theory perspective
- Introduction to testing graph properties
- An optimal tester for \(k\)-linear
- Introduction to testing graph properties
- Almost optimal proper learning and testing polynomials
- scientific article; zbMATH DE number 1819631 (Why is no real title available?)
- scientific article; zbMATH DE number 1857651 (Why is no real title available?)
This page was built for publication: A brief introduction to property testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933359)