Reviews for Computational Complexity Theory

The average rating for Computational Complexity Theory based on 2 reviews is 3 stars.

Review # 1 was written on 2014-09-10 00:00:00 Larry Morton 2008-09-24, Amazon. This $200 monstrosity, said to be the most exciting thing in FoC since Scott Aaronson's dissertation, suddenly showed up on Amazon for $25 from three sellers -- I swear to god, the used book racket's running the same software the QCF (qualitative and computational finance, aka doing ODE's (ordinary differential equations) 22 hours a day for three-quarters of a million per annum from goldman sachs or merrill lynch...well, maybe not ML anymore, har de har har) guys wrote for the stock market racket, likely purchased from the Ukranian code repackaging scene. Well, I just got my ass handed to me by a textbook in a way I've not experienced for several years. I quite honestly have precious little idea what this book is about, despite having leafed through it for an hour and spent some time frontloading concepts. Dammit, I hate knowing there's people this much better-trained and intelligent than me regarding any area of computer science, grrrrrrrrr! For whatever it's worth, things did look fairly well put-together for anyone who speaks largely in terms of Komolgorov complexity algebras (I was fine up until the "algebras of complexity" there, at which point my brain melted). Damnit damnit damnit why am I not smarter? [froth]

Review # 2 was written on 2016-07-18 00:00:00 Melissa Hayes An absolutely essential book for representation theory. Well translated etc, the only thing I would say is a fair few of the proofs are needlessly complicated. For instance, I remember early on a proof where we have to prove something for all finite dimensional vector spaces, which one would naturally do by induction starting from a line and working upwards. However, Serre insists on this very obtuse proof in strong induction, starting from the 0 vector space? Very weird.