|Listed in category:
Have one to sell?

Complexity and Information (Lezioni Lincee) - Paperback, by Traub J. F.; - Good

BooksRun
(158278)
Registered as a business seller
US $5.85
ApproximatelyEUR 5.05
Condition:
Good
Last one1 sold
Breathe easy. Free postage and returns.
Other people bought this. 1 has already sold.
Postage:
Free USPS Media MailTM.
Located in: Philadelphia, Pennsylvania, United States
Delivery:
Estimated between Thu, 7 Aug and Tue, 12 Aug to 94104
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the delivery service selected, the seller's delivery history and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Seller pays for return postage.
Payments:
    Diners Club

Shop with confidence

eBay Money Back Guarantee
Get the item you ordered or your money back. Learn moreeBay Money Back Guarantee - opens new window or tab
Seller assumes all responsibility for this listing.
eBay item number:146262544023
Last updated on 03 Aug, 2025 09:32:08 BSTView all revisionsView all revisions

Item specifics

Condition
Good: A book that has been read, but is in good condition. Minimal damage to the book cover eg. ...
Book Title
Complexity and Information (Lezioni Lincee)
ISBN
9780521485067

About this product

Product Identifiers

Publisher
Cambridge University Press
ISBN-10
0521485061
ISBN-13
9780521485067
eBay Product ID (ePID)
377416

Product Key Features

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

Dimensions

Item Height
0.4 in
Item Weight
7.1 Oz
Item Length
8.5 in
Item Width
5.5 in

Additional Product Features

Intended Audience
Scholarly & Professional
LCCN
98-029464
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, "...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, "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, ‘Clearly written, filled with interesting examples, important theorems and tantalising conjectures, this is destined to be a classic.’New Scientist
Dewey Edition
21
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

Seller business information

I certify that all my selling activities will comply with all EU laws and regulations.
About this seller

BooksRun

99.2% positive Feedback845K items sold

Joined Aug 2014
Registered as a business seller
BooksRun is an online seller of new and used books and textbooks. Best prices for books since 2014, we're a one-stop shop for all sorts of books, from fiction to textbooks. We're constantly expanding ...
See more

Detailed seller ratings

Average for the last 12 months
Accurate description
4.9
Reasonable postage cost
5.0
Delivery time
5.0
Communication
5.0

Popular categories from this shop

Seller Feedback (175,155)

All ratings
Positive
Neutral
Negative
    • -***i (357)- Feedback left by buyer.
      Past month
      Verified purchase
      good
    See all Feedback