A brief introduction to property testing
DOI10.1007/978-3-642-16367-8_1zbMATH Open1308.68149OpenAlexW2115574874MaRDI QIDQ4933359FDOQ4933359
Authors: Oded Goldreich 
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_1
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational learning theory (68Q32) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)
Cites Work
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Self-testing/correcting with applications to numerical problems
- Robust Characterizations of Polynomials with Applications to Program Testing
- Algorithmic and analysis techniques in property testing
- A combinatorial characterization of the testable graph properties, it's all about regularity
- A sublinear bipartiteness tester for bounded degree graphs
- Tolerant property testing and distance approximation
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Cited In (11)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
