Trending Bestseller

Computational Complexity and Local Algorithms

On the Interplay Between Randomness and Computation

No reviews yet Write a Review
Paperback / softback
11 July 2025
$167.44
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:

This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms.

The works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces.

You Can Find This Title In

    Product Details
    ISBN-13
    9783031889455
    Author
    Oded Goldreich
    Publisher
    Springer Nature B.V.
    Published
    11 July 2025
    Format
    Paperback / softback

    This product hasn't received any reviews yet. Be the first to review this product!

    $167.44
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Computational Complexity and Local Algorithms

    $167.44

    Description

    This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms.

    The works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces.

    You Can Find This Title In

      This Title Is Categorised As