Noisy information and computational complexity /
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge :
Cambridge University Press,
1996.
|
| Subjects: | |
| Online Access: | CONNECT |
MARC
| LEADER | 00000nam a22000008i 4500 | ||
|---|---|---|---|
| 001 | mig00005073661 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020621.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 090722s1996||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511600814 (ebook) | ||
| 020 | |z 9780521553681 (hardback) | ||
| 020 | |z 9780521349444 (paperback) | ||
| 035 | 0 | 0 | |a ocm00000001camebacr9780511600814 |
| 040 | |a UkCbUP |b eng |e rda |c UkCbUP | ||
| 050 | 0 | 0 | |a QA267.7 |b .P57 1996 |
| 082 | 0 | 0 | |a 003/.54 |2 20 |
| 099 | |a Electronic book | ||
| 100 | 1 | |a Plaskota, Leszek, |e author. | |
| 245 | 1 | 0 | |a Noisy information and computational complexity / |c Leszek Plaskota. |
| 246 | 3 | |a Noisy Information & Computational Complexity | |
| 264 | 1 | |a Cambridge : |b Cambridge University Press, |c 1996. | |
| 300 | |a 1 online resource (xi, 308 pages) : |b digital, PDF file(s). | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015). | ||
| 520 | |a 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. | ||
| 650 | 0 | |a Computational complexity. | |
| 730 | 0 | |a Cambridge EBA Collection | |
| 776 | 0 | 8 | |i Print version: |z 9780521553681 |
| 856 | 4 | 0 | |u https://ezproxy.mtsu.edu/login?url=https://doi.org/10.1017/CBO9780511600814 |z CONNECT |t 0 |
| 907 | |a 3912429 |b 08-25-20 |c 03-18-19 | ||
| 998 | |a wi |b 08-25-20 |c m |d z |e - |f eng |g enk |h 0 |i 2 | ||
| 999 | f | f | |i 565e708a-8e9b-4a07-8fa2-86dba661b944 |s c820a8a7-f89a-4930-be5e-9cc937813cdf |t 0 |
| 952 | f | f | |a Middle Tennessee State University |b Main |c James E. Walker Library |d Electronic Resources |t 0 |e QA267.7 .P57 1996 |h Library of Congress classification |
| 856 | 4 | 0 | |t 0 |u https://ezproxy.mtsu.edu/login?url=https://doi.org/10.1017/CBO9780511600814 |z CONNECT |
