On the average-case complexity of property testing
From MaRDI portal
Recommendations
Cites work
- A Brief Introduction to Property Testing
- A sublinear bipartiteness tester for bounded degree graphs
- Algebraic property testing: the role of invariance
- Algorithmic and analysis techniques in property testing
- scientific article; zbMATH DE number 2019636 (Why is no real title available?)
- scientific article; zbMATH DE number 1775411 (Why is no real title available?)
- On the randomness complexity of property testing
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Proximity oblivious testing and the role of invariances
- Quick approximation to matrices and applications
- Robust Characterizations of Polynomials with Applications to Program Testing
- Testing monotonicity
- Testing subgraphs in large graphs
- The complexity of promise problems with applications to public-key cryptography
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Three theorems regarding testing graph properties
Cited in
(3)
This page was built for publication: On the average-case complexity of property testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088183)