0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing

Buy Now

Algorithmic and Analysis Techniques in Property Testing (Paperback) Loot Price: R2,349
Discovery Miles 23 490
Algorithmic and Analysis Techniques in Property Testing (Paperback): Dana Ron

Algorithmic and Analysis Techniques in Property Testing (Paperback)

Dana Ron

Series: Foundations and Trends (R) in Theoretical Computer Science

 (sign in to rate)
Loot Price R2,349 Discovery Miles 23 490 | Repayment Terms: R220 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Now Publishers Inc
Country of origin: United States
Series: Foundations and Trends (R) in Theoretical Computer Science
Release date: February 2010
First published: 2010
Authors: Dana Ron
Dimensions: 234 x 156 x 8mm (L x W x T)
Format: Paperback
Pages: 152
ISBN-13: 978-1-60198-318-3
Categories: Books > Computing & IT > General theory of computing > General
Books > Computing & IT > Applications of computing > General
LSN: 1-60198-318-2
Barcode: 9781601983183

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners