This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 6.841 Advanced Complexity Theory May 4, 2009 Lecture 23 Lecturer: Madhu Sudan Scribe: Rishi Gupta Project Presentations Presentations are this Wednesday 9am12pm and Thursday 9am1pm. Slots may be moved around to space them out/ensure we don’t run up against room reservation deadlines. The 20 minute limit will be enforced. Powerpoint is highly recommended, since you won’t be able to write that much or get through much material in a 20 minute interactive session. If you do write on the board, you should have all your intermediate steps planned out beforehand. Also, know what you’re going to do if we do make it interactive and you have a few minutes less than you think you do. Send in your paper and presentation before you present, preferably at least 24 hours before. AverageCase Complexity Today we’re going to give an overview of AverageCase Complexity . This was originally a three day lecture, and now it’s a one day lecture; what’s being lost is the proofs. We will give motivation for the field, some definitions, and a flavor of the results. Motivation We’ve already seen that worstcase instances of Permanent reduce to random instances of Permanent (Lip ton), implying that for Permanent the averagecase complexity equals the worstcase complexity. This is not very encouraging. However, we hear about “SATsolvers” and other algorithms for NPhard problems all the time. Some times people are just mistaken (eg. they don’t realize their graphs have some hidden constraint), sometimes they are just using an approximation algorithm, but sometimes it legitimately seems like the empirical, reallife problems are simply not the worstcase ones. The key is, the distribution of reallife problems is not the same as the distribution of random problems (say, of Clique). People are very interested in finding algorithms that work on reallife distributions of NP. An example might be compiler optimization. Another application of averagecase complexity is cryptography. People would like to find functions f such that f is easy to compute and f 1 is hard to compute (where easy/hard refer to polynomialtime, as usual). More strongly, people want functions f for which they both know the value of f 1 on some inputs x i and where it’s still hard to compute f 1 on those x i . This means it’s not just sufficient to solve all the averagecase or easy instances of a function and declare rest as hard....
View
Full
Document
This note was uploaded on 04/02/2010 for the course CS 6.841 taught by Professor Madhusudan during the Spring '09 term at MIT.
 Spring '09
 MadhuSudan

Click to edit the document details