http://blogs.oregonstate.edu/glencora/2012/03/17/crash-course-in-tcs/ Assistant Professor, School of Electrical Engineering and Computer Science, Oregon State University Mon, 06 May 2013 04:32:43 +0000 hourly 1 http://wordpress.org/?v=3.5.1 http://blogs.oregonstate.edu/glencora/2012/03/17/crash-course-in-tcs/#comment-380 Glencora Borradaile Wed, 21 Mar 2012 20:56:01 +0000 http://blogs.oregonstate.edu/glencora/?p=939#comment-380 Thanks for the link!

]]> http://blogs.oregonstate.edu/glencora/2012/03/17/crash-course-in-tcs/#comment-379 Glencora Borradaile Wed, 21 Mar 2012 20:55:01 +0000 http://blogs.oregonstate.edu/glencora/?p=939#comment-379 Given the time limit (< 2hr), I did not attempt to be complete. However, I would be interested to know what you take out in order to add something else.

]]> http://blogs.oregonstate.edu/glencora/2012/03/17/crash-course-in-tcs/#comment-378 Daniil Mon, 19 Mar 2012 19:35:51 +0000 http://blogs.oregonstate.edu/glencora/?p=939#comment-378 What about stuff like computational logic and automata theory? Do you not consider it TCS?

]]> http://blogs.oregonstate.edu/glencora/2012/03/17/crash-course-in-tcs/#comment-376 Omer Reingold Sun, 18 Mar 2012 04:12:58 +0000 http://blogs.oregonstate.edu/glencora/?p=939#comment-376 It is great that you are spreading the word about TOC. You may be interested in a general audience talk I gave a few years ago: http://research.microsoft.com/en-us/people/omreing/school.ppt

]]> http://blogs.oregonstate.edu/glencora/2012/03/17/crash-course-in-tcs/#comment-375 JK Sun, 18 Mar 2012 01:12:57 +0000 http://blogs.oregonstate.edu/glencora/?p=939#comment-375 You could, of course, mention cryptography. (If complexity is about the limits of computation, and algorithms involves working within those limits, then cryptography exploits those limits for beneficial use.)

]]>