Recently Viewed

New

Algorithmic and Analysis Techniques in Property Testing by Dana Ron 9781601983183

No reviews yet Write a Review
RRP: £89.50
Booksplease Price: £76.12
Booksplease saves you 15%

  Bookmarks: Included free with every order
  Delivery: We ship to over 200 countries from the UK
  Range: Millions of books available
  Reviews: Booksplease rated "Excellent" on Trustpilot

  FREE UK DELIVERY: When You Buy 3 or More Books - Use code: FREEUKDELIVERY in your cart!

SKU:
9781601983183
MPN:
9781601983183
Available from Booksplease!
Global delivery available
Global delivery available
Global delivery available
Global delivery available
Global delivery available
Availability: Usually dispatched within 5 working days

Frequently Bought Together:

Total: Inc. VAT
Total: Ex. VAT

Description

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.

Book Information
ISBN 9781601983183
Author Dana Ron
Format Paperback
Page Count 152
Imprint now publishers Inc
Publisher now publishers Inc
Weight(grams) 224g

Reviews

No reviews yet Write a Review

Booksplease  Reviews