Complexity and Information by A. G. Werschulz and J. F. Traub

US $33.74
ApproximatelyRM 142.71
or Best Offer
Was US $44.99 (25% off)What does this price mean?
Recent sales price provided by the seller
Condition:
Like New
Breathe easy. Returns accepted.
Shipping:
US $5.22 (approx RM 22.08) USPS Media MailTM.
Located in: New Haven, Connecticut, United States
Delivery:
Estimated between Mon, 27 Oct and Sat, 1 Nov to 94104
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:395459952017

Item specifics

Condition
Like New: A book in excellent condition. Cover is shiny and undamaged, and the dust jacket is ...
ISBN
9780521480055
Category

About this product

Product Identifiers

Publisher
Cambridge University Press
ISBN-10
0521480051
ISBN-13
9780521480055
eBay Product ID (ePID)
375467

Product Key Features

Number of Pages
160 Pages
Language
English
Publication Name
Complexity and Information
Publication Year
1998
Subject
Machine Theory, Numerical Analysis, General
Type
Textbook
Author
A. G. Werschulz, J. F. Traub
Subject Area
Mathematics, Computers
Series
Lezioni Lincee Ser.
Format
Hardcover

Dimensions

Item Height
0.6 in
Item Weight
10.8 Oz
Item Length
8.9 in
Item Width
5.7 in

Additional Product Features

Intended Audience
Scholarly & Professional
LCCN
98-029464
Dewey Edition
21
Reviews
"Really a jewel...written with loving care and in an elegant style." Institute of Discrete Mathematics, "The exposition is straightforward and clear, with well-chosen diagrams to smooth the way...The broad expanse between technical and general themes may be one of the more challenging and appealing aspects of the book...This book provides worthwhile evidence that IBC (information based complexity) is an important, albeit highly specialized, approach to understanding and applying information in modeling the complexity of a variety of mathematically formulated problems." Complexity, "Anyone interested in numerical analysis and scientific computing can profit from the book and its many insights." Siam Review, 'Clearly written, filled with interesting examples, important theorems and tantalising conjectures, this is destined to be a classic.' New Scientist, "This short volume packs so much information into so small a space that it stretches the imagination as to know how the authors did it. Clearly written, filled with interesting examples, important theorems and tantalizing conjectures, this book should be taken as holiday reading by everyone concerned with using a computer to solve real problems. It's destined to be a classic." New Scientist, "...gives a good grounding in the essential issues of complexity and information. For an overview of the larger issues, this small book is excellent." Bulletin of the AMS, ‘Clearly written, filled with interesting examples, important theorems and tantalising conjectures, this is destined to be a classic.’New Scientist, 'Clearly written, filled with interesting examples, important theorems and tantalising conjectures, this is destined to be a classic.'New Scientist
Illustrated
Yes
Dewey Decimal
511.3
Table Of Content
Part I. Fundamentals: 1. Introduction; 2. Information-based complexity; 3. Breaking the curse of dimensionality; Part II. Some Interesting Topics: 4. Very high-dimensional integration and mathematical finance; 5. Complexity of path integration; 6. Are ill-posed problems solvable?; 7. Complexity of nonlinear problems; 8. What model of computation should be used by scientists?; 9. Do impossibility theorems from formal models limit scientific knowledge? 10. Complexity of linear programming; 11. Complexity of verification; 12. Complexity of implementation testing; 13. Noisy information; 14. Value of information in computation; 15. Assigning values to mathematical hypotheses; 16. Open problems; 17. A brief history of information-based complexity; Part III. References: 18. A guide to the literature; Bibliography; Subject index; Author index.
Synopsis
The twin themes of computational complexity and information pervade this 1998 book. It starts with an introduction to the computational complexity of continuous mathematical models, that is, information-based complexity. This is then used to illustrate a variety of topics, including breaking the curse of dimensionality, complexity of path integration, solvability of ill-posed problems, the value of information in computation, assigning values to mathematical hypotheses, and new, improved methods for mathematical finance. The style is informal, and the goals are exposition, insight and motivation. A comprehensive bibliography is provided, to which readers are referred for precise statements of results and their proofs. As the first introductory book on the subject it will be invaluable as a guide to the area for the many students and researchers whose disciplines, ranging from physics to finance, are influenced by the computational complexity of continuous problems., Information-based complexity is used to illustrate a variety of topics, including breaking the curse of dimension, complexity of path integration, solvability of ill-posed problems, the value of information in computation, assigning values to mathematical hypotheses, and new, improved methods for mathematical finance. This 1998 book will be an invaluable guide to the subject., The twin themes of computational complexity and information pervade this book. It starts with an introduction to information-based complexity, that is, the computational complexity of continuous mathematical models. It then moves to a variety of topics, including breaking the curse of dimensionality, complexity of path integration, solvability of ill-posed problems, value of information in computation, assigning values to mathematical hypotheses, and mathematical finance. The style is informal, and the goal is motivation and insight. Precise statements and proofs can be found in the monographs and papers included in the comprehensive bibliography. The book will be essential reading for researchers in the many disciplines influenced by the computational complexity of continuous problems.
LC Classification Number
QA267.7 .T7 1998

Item description from the seller

About this seller

Bibliomaniacs Anonymous

100% positive feedback408 items sold

Joined Dec 2017
We are a small shop selling the type of books we'd want to own. We believe that every book has its reader, and that sometimes you find the book you need most when you are looking for something else, ...
See more

Detailed Seller Ratings

Average for the last 12 months
Accurate description
5.0
Reasonable shipping cost
4.6
Shipping speed
5.0
Communication
--

Seller feedback (116)

All ratingsselected
Positive
Neutral
Negative
  • s***s (696)- Feedback left by buyer.
    Past month
    Verified purchase
    Excellent packaging and quick receipt of item as described. Thank you!
  • g***e (80)- Feedback left by buyer.
    Past month
    Verified purchase
    This book shipped to me rapidly and it was carefully packaged. Thanks, it arrived in excellent condition, and I am happy with the value, appearance and quality of the book. (I have to confess, though, I haven't started reading yet -- it's on the bookshelf waiting for a quiet rainy day...)
  • o***o (869)- Feedback left by buyer.
    Past year
    Verified purchase
    Absolutely amazing seller. Just a perfectly packed and protected book that came as described. Everything is just perfect. Many kind thanks again!