Introduction to Property Testing
Cambridge University Press (Verlag)
978-1-107-19405-2 (ISBN)
Property testing is concerned with the design of super-fast algorithms for the structural analysis of large quantities of data. The aim is to unveil global features of the data, such as determining whether the data has a particular property or estimating global parameters. Remarkably, it is possible for decisions to be made by accessing only a small portion of the data. Property testing focuses on properties and parameters that go beyond simple statistics. This book provides an extensive and authoritative introduction to property testing. It provides a wide range of algorithmic techniques for the design and analysis of tests for algebraic properties, properties of Boolean functions, graph properties, and properties of distributions.
Oded Goldreich is Professor of Computer Science at the Weizmann Institute of Science and holds the Meyer W. Weisgal Professorial Chair. He has made numerous contributions to property testing and to the theory of computation at large. He is the author of several books, including the two-volume Foundations of Cryptography (Cambridge, Vol. 1 2008, Vol. 2 2009) and Computational Complexity: A Conceptual Perspective (Cambridge, 2008). He is an associate editor of the journal Computational Complexity, former editor of the Journal of Cryptology and SIAM Journal on Computing, and has been invited to speak at numerous conferences, including the 1994 International Congress of Mathematicians. Oded Goldreich was awarded the 2017 Donald E. Knuth prize for outstanding contributions to the foundation of computer science.
1. The main themes; 2. Testing lineriality; 3. Low degree tests; 4. Testing monotonicity; 5. Testing dictatorships, juntas, and monomials; 6. Testing by implicit sampling; 7. Lower bounds techniques; 8. Testing graph properties in the dense graph model; 9. Testing graph properties in the bounded-degree graph model; 10. Testing graph properties in the general graph model; 11. Testing properties of distributions; 12. Ramifications and related topics; 13. Locally testable codes and proofs.
| Erscheinungsdatum | 02.01.2018 |
|---|---|
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 182 x 259 mm |
| Gewicht | 990 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| ISBN-10 | 1-107-19405-9 / 1107194059 |
| ISBN-13 | 978-1-107-19405-2 / 9781107194052 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
