Reviews for Mathematical Foundations Of Information Retrieval

The average rating for Mathematical Foundations Of Information Retrieval based on 2 reviews is 3.5 stars.

Review # 1 was written on 2007-12-09 00:00:00 Brian Borrero i'm not aware of too many choices for introductory graduate complexity theory. this one is not great, but it'll work.

Review # 2 was written on 2012-03-05 00:00:00 David Preaus If you read this book as first time in order to understand Computational Complexity, then you're probably not going to like it. You need to read Sipser's textbook before you read this book and make sure that you have a strong background in discrete mathematics (if not, then see Rosen's textbook in Discrete Mathematics). This book is recommended by best people in complexity and algorithms such as Scott Aaronson, Sipser, etc. You need to solve as many exercises as you go. The book has five parts: Part I: Algorithms Part II: Logic Part III: P and NP Part IV: Inside P Part V: Beyond NP The most important parts are in Part I, III.