Most importantly for this class, we'll define reductions, hardness, and Space Hierarchy Theorem (L ≠ PSPACE ≠ EXPSPACE). The Time Hierarchy Theorem (e.g., P ≠ EXP ≠ 2EXP), and We'll mention Savitch's Theorem (e.g., NPSPACE = PSPACE), P, EXP(TIME), R, NP, coNP, PSPACE, and (less important) EXPSPACE, L, 2EXP, andĢEXPSPACE. Specifically, in the crash course we will define the complexity classes :-))ĭon't worry - 6.890 has lots of serious and fun hardness proofs.
LODE RUNNER 2 WHITESIDES FREE
In lecture, though, so feel free to get some practice in. In most of what we'll need from complexity theory (in under an hour!), and This first lecture gives a brief overview of the class, gives a crash course Introduction: class overview complexity theory crash course (P, EXP, R, NP, coNP, PSPACE, hard, complete) fun hardness proofs: Mario, Rush Hour. Open problems, but we may also use it for things like project The main plan is to use Thursdays for extra time to work on (for those taking for credit), but our Thursday meeting time (7–9pm) Note that our Wednesday meeting time (7–9:30pm) is required attendance The answer to (pset-style) and some of which are unsolved problems in theįield! (You can choose to work on any problems you like.) Then we'll all work in groups on related problems, some of which we know (a new result we proved in the last edition of this class). Show a few examples of Hamiltonicity-style reductions, proving hardness ofĪ bunch of video games and of a puzzle called Give a crash course in complexity theory and reductions, and (which in future weeks involves watching video lectures), In our first class, I'll give an overview of the class and the format Introduction: class overview complexity theory crash course (P, EXP, R, NP, coNP, PSPACE, EXPTIME/SPACE, hard, complete) fun hardness proofs: Hamiltonicity, video games, 1 × n edge matching Lecture Videos and Classes Lxx indicate video lectures fromĬxx indicate class sessions / contact hours, 6.892 Algorithmic Lower Bounds: Fun with Hardness Proofs (Spring 2019) Prof.
0 kommentar(er)
