Algorithmic and Analysis Techniques in Property Testing
Seiten
2010
now publishers Inc (Verlag)
978-1-60198-318-3 (ISBN)
now publishers Inc (Verlag)
978-1-60198-318-3 (ISBN)
In the last two decades, property testing algorithms have been designed for many types of objects and properties, amongst them, graph properties, algebraic properties, geometric properties, and more. This book surveys results in property testing, with an emphasis on common analysis and algorithmic techniques.
Property testing algorithms are ultra-efficient algorithms that decide whether a given object (e.g., a graph) has a certain property (e.g., bipartiteness), or is significantly different from any object that has the property. To this end property testing algorithms are given the ability to perform (local) queries to the input, though the decisions they need to make usually concern properties with a global nature.
In the last two decades, property testing algorithms have been designed for many types of objects and properties, amongst them, graph properties, algebraic properties, geometric properties, and more. In this book the authors survey results in property testing, with an emphasis on common analysis and algorithmic techniques. Among the techniques surveyed are the following:
a) The self-correcting approach, which was mainly applied in the study of property testing of algebraic properties.
b) The enforce and test approach, which was applied quite extensively in the analysis of algorithms for testing graph properties (in the dense-graphs model), as well as in other contexts.
c) Szemeredi's Regularity Lemma, which plays a very important role in the analysis of algorithms for testing graph properties (in the dense-graphs model).
d) The approach of Testing by implicit learning, which implies efficient testability of membership in many functions classes.
e) Algorithmic techniques for testing properties of sparse graphs, which include local search and random walks.
Property testing algorithms are ultra-efficient algorithms that decide whether a given object (e.g., a graph) has a certain property (e.g., bipartiteness), or is significantly different from any object that has the property. To this end property testing algorithms are given the ability to perform (local) queries to the input, though the decisions they need to make usually concern properties with a global nature.
In the last two decades, property testing algorithms have been designed for many types of objects and properties, amongst them, graph properties, algebraic properties, geometric properties, and more. In this book the authors survey results in property testing, with an emphasis on common analysis and algorithmic techniques. Among the techniques surveyed are the following:
a) The self-correcting approach, which was mainly applied in the study of property testing of algebraic properties.
b) The enforce and test approach, which was applied quite extensively in the analysis of algorithms for testing graph properties (in the dense-graphs model), as well as in other contexts.
c) Szemeredi's Regularity Lemma, which plays a very important role in the analysis of algorithms for testing graph properties (in the dense-graphs model).
d) The approach of Testing by implicit learning, which implies efficient testability of membership in many functions classes.
e) Algorithmic techniques for testing properties of sparse graphs, which include local search and random walks.
1: Introduction 2: Preliminaries 3: The Self-Correcting Approach 4: The Enforce-and-Test Approach 5: Testing by Implicit Learning 6: The Regularity Lemma 7: Local-Search Algorithms 8: Random Walks Algorithms 9: Lower Bounds 10: Other Results 11: Extensions, Generalizations, and Related Problems. Acknowledgements. References.
| Erscheint lt. Verlag | 8.2.2010 |
|---|---|
| Reihe/Serie | Foundations and Trends® in Theoretical Computer Science |
| Verlagsort | Hanover |
| Sprache | englisch |
| Maße | 156 x 234 mm |
| Gewicht | 224 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| ISBN-10 | 1-60198-318-2 / 1601983182 |
| ISBN-13 | 978-1-60198-318-3 / 9781601983183 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
Lehmanns Media (Verlag)
CHF 55,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …
Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
