Description

Book Synopsis

In this volume, which was originally published in 1996, noisy information is studied in the context of computational complexity; in other words the text deals with the computational complexity of mathematical problems for which information is partial, noisy and priced. The author develops a general theory of computational complexity of continuous problems with noisy information and gives a number of applications; deterministic as well as stochastic noise is considered. He presents optimal algorithms, optimal information, and complexity bounds in different settings: worst case, average case, mixed worst-average and average-worst, and asymptotic. The book integrates the work of researchers in such areas as computational complexity, approximation theory and statistics, and includes many fresh results as well. About two hundred exercises are supplied with a view to increasing the reader's understanding of the subject. The text will be of interest to professional computer scientists, statis

Trade Review

"The monograph is well organized and carefully written. It serves as an excellent reference book for branch of computational complexity. It is relevant also to statisticians and to applied mathematicians who analyze algorithms for problems for problems with noisy data." Klaus Ritter, Mathematical Reviews

Table of Contents

1. Overview; 2. Worst case setting; 3. Average case setting; 4. Worst-average case setting; 5. Average-worst case setting; 6. Asymptotic setting; Bibliography; Glossary; Indices.

Noisy Information and Computational Complexity

    Product form

    A Paperback by Leszek Plaskota

    £42.99

    Includes FREE delivery

    Order before 4pm today for delivery by Thu 3 Dec 2026.

    15 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Noisy Information and Computational Complexity by Leszek Plaskota

      Book details

      Published 29 March 2012
      ISBN-13 9780521349444
      978-0521349444
      ISBN-10 0521349443

      Description

      Book Synopsis

      In this volume, which was originally published in 1996, noisy information is studied in the context of computational complexity; in other words the text deals with the computational complexity of mathematical problems for which information is partial, noisy and priced. The author develops a general theory of computational complexity of continuous problems with noisy information and gives a number of applications; deterministic as well as stochastic noise is considered. He presents optimal algorithms, optimal information, and complexity bounds in different settings: worst case, average case, mixed worst-average and average-worst, and asymptotic. The book integrates the work of researchers in such areas as computational complexity, approximation theory and statistics, and includes many fresh results as well. About two hundred exercises are supplied with a view to increasing the reader's understanding of the subject. The text will be of interest to professional computer scientists, statis

      Trade Review

      "The monograph is well organized and carefully written. It serves as an excellent reference book for branch of computational complexity. It is relevant also to statisticians and to applied mathematicians who analyze algorithms for problems for problems with noisy data." Klaus Ritter, Mathematical Reviews

      Table of Contents

      1. Overview; 2. Worst case setting; 3. Average case setting; 4. Worst-average case setting; 5. Average-worst case setting; 6. Asymptotic setting; Bibliography; Glossary; Indices.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account