A Brief Introduction to Property Testing
From MaRDI portal
Publication:3088197
DOI10.1007/978-3-642-22670-0_31zbMath1343.68298OpenAlexW3020850430MaRDI QIDQ3088197
Publication date: 19 August 2011
Published in: Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22670-0_31
Related Items
New techniques and tighter bounds for local computation algorithms, Erasures versus errors in local decoding and property testing, Unnamed Item, On the Average-Case Complexity of Property Testing, Randomness and Computation, Another Motivation for Reducing the Randomness Complexity of Algorithms
Cites Work
- Self-testing/correcting with applications to numerical problems
- A sublinear bipartiteness tester for bounded degree graphs
- Tolerant property testing and distance approximation
- A combinatorial characterization of the testable graph properties
- Introduction to Testing Graph Properties
- Property testing and its connection to learning and approximation
- Robust Characterizations of Polynomials with Applications to Program Testing
- Property Testing of Massively Parametrized Problems – A Survey
- lgorithmic and Analysis Techniques in Property Testing
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Property testing in bounded degree graphs
