The average rating for Computational Complexity and Statistical Physics based on 2 reviews is 3 stars.
Review # 1 was written on 2011-05-25 00:00:00 Shelly Graham This is a good book, but my major complaint is how bogged down in details it gets. I know this is a math book, but there are dozens of pages devoted to very specific examples, that I didn't find the least bit illuminating. There is definitely polish here; many of the proofs are concise and slick, without leaving too much out. And the exercises are challenging and thought-provoking. But by the time I got to the last section - on specific examples of exotic isometries - I almost wanted to stop reading. I would give this book a higher rating (4 stars) if some of these examples were cut out (and more general theory added in its place). That said, this is one of the best sources for Glauberman's Z* theorem, without having to do (much) modular representation theory. Its proof is given in an appendix. I just wish that appendix wasn't the only reason I managed to finish the book. |
Review # 2 was written on 2014-05-28 00:00:00 Mark Goldberg An exceptional textbook for computer science. This is not among the very popular titles on the subject, but one of the best. |
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!!