Mon premier blog

Computational complexity: A modern approach Boaz Barak, Sanjeev Arora
Publisher: Cambridge University Press

Feasible computations and provable complexity properties (1978) and his follow-up article Observations about the development of theoretical computer science (1981) are well worth reading in conjunction with (say) chapters 1,2, and 6 of Sanjeev Arora and Boaz Barak's Computational Complexity: a Modern Approach. On February 20, 2012 at 1:46 am | Reply Greg. In the letter, Nash takes a step beyond Shannon's information-theoretic formalization of cryptography . Computational Complexity: A Modern Approach: Sanjeev Arora, Boaz. "Here one finds both a basic introduction and comprehensive treatments, especially of topics that have borne spectacular fruit in just the last few years. Complexity Theory: A Modern Approach (out of Princeton): http://www.cs.princeton.edu/theory/complexity/. While there are beautiful modern treatments of all contained in his paper, I think we can learn quite a bit from seeing the original masterpiece. The best book on the subject I know of is Introduction to the Theory of Computation, by Michael Sipser. He then goes on to put forward an amazingly prescient analysis anticipating computational complexity theory as well as modern cryptography. What he suggests is really close to the pragmatic approach of modern cryptography, but not to modern complexity theory. No Matter & Never Mind,Computational Complexity: A Modern Approach.