Complexity and Information

Complexity and Information

by J. F. Traub, A. G. Werschulz

139 pages· 1998· ISBN 9780521485067

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
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.

Discuss Complexity and Information with other readers

Join or start a book club for Complexity and Information on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Complexity and Information?

Sign up free on Readfeed, then browse public clubs or start your own club with Complexity and Information as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Complexity and Information with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Complexity and Information with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.