Skip to main content

Shopping Cart

You're getting the VIP treatment!

Item(s) unavailable for purchase
Please review your cart. You can remove the unavailable item(s) now or we'll automatically remove it at Checkout.
itemsitem
itemsitem

Recommended For You

Loading...
  • Computational Complexity and Local Algorithms

    On the Interplay Between Randomness and Computation

    Edited by Oded Goldreich ...
    Series series Computer Science (R0)
    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 ... Read more

    $80.99 USD

  • Providing Sound Foundations for Cryptography

    On the work of Shafi Goldwasser and Silvio Micali

    Edited by Oded Goldreich ...
    Series series ACM Books
    Cryptography is concerned with the construction of schemes that withstand any abuse.A cryptographic scheme is constructed so as to maintain a desired functionality, even under malicious attempts aimed at making it deviate from its prescribed behavior. The design of cryptographic systems must be based on firm foundations, whereas ad hoc approaches and heuristics are a very dangerous way to go. ... Read more

    $71.99 USD

  • Introduction to Property Testing

    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 ... Read more

    $95.19 USD

  • P, NP, and NP-Completeness

    The Basics of Computational Complexity

    The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their ... Read more

    $47.59 USD

  • Foundations of Cryptography: Volume 2, Basic Applications

    Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. Foundations of Cryptography presents a rigorous and systematic treatment of foundational issues, defining cryptographic tasks and solving cryptographic problems. The emphasis is on the ... Read more

    $65.59 USD

  • Computational Complexity and Property Testing

    On the Interplay Between Randomness and Computation

    Series series Computer Science (R0)
    This volume contains a collection of studies in the areas of complexity theory and property testing. The 21 pieces of scientific work included were conducted at different times, mostly during the last decade. Although most of these works have been cited in the literature, none of them was formally published before.Within complexity theory the topics include constant-depth Boolean circuits, ... Read more

    $80.09 USD