Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Noisy Information and Computational Complexity
  • Cited by 82
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      13 January 2010
      16 May 1996
      ISBN:
      9780511600814
      9780521553681
      9780521349444
      DOI:
      https://doi.org/10.1017/CBO9780511600814
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.562kg, 324 Pages
      Dimensions:
      (229 x 152 mm)
      Weight & Pages:
      0.48kg, 322 Pages
      • Subjects:
      Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computational Science, Computer Science
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computational Science, Computer Science
    Information

    Book description

    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, statisticians, applied mathematicians, engineers, control theorists, and economists.

    Reviews

    "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

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.