Resources | Advanced Complexity Theory | Mathematics | MIT OpenCourseWare

Course Info

Instructors

Departments

As Taught In

Spring 2016

Level

Graduate

Topics

Learning Resource Types

Lecture Notes

Problem Sets

Projects with Examples

Download Course

Download

Download course

This package contains the same content as the online version of the course. For help downloading and using course materials, read our FAQs.

Note: The downloaded course may not work on mobile devices. We recommend using a computer with the downloaded course package.

Assignments

Advanced Complexity Theory: Problem Set 1

Advanced Complexity Theory: Problem Set 2

Advanced Complexity Theory: Problem Set 3

Advanced Complexity Theory: Problem Set 4

Lecture Notes

18.405J S16 Lecture 12: Randomized Communication

18.405J S16 Lecture 14: Intro to PCP

18.405J S16 Lecture 16: Exponential Sized PCP

18.405J S16 Lecture 16: Linearity Testing

18.405J S16 Lecture 17: PCP with Polylogarithmic Queries and Sum Check

18.405J S16 Lecture 18: Unique Games Conjecture and Hardness for MAX-2LIN

18.405J S16 Lecture 20: P vs BPP 1

18.405J S16 Lecture 21: P vs BPP 2

18.405J S16 Lecture 22: Derandomization Implies Circuit Lower Bounds

18.405J S16 Lecture 5: Toda's Theorem

Projects

Advanced Complexity Theory: A Survey of Communication Complexity for Proving Lower Bound of Data Structures in Cell-Probe Model

Advanced Complexity Theory: A Survey of Parallel Repetition and Projection Games

Advanced Complexity Theory: A Survey of Parallel Repetition and Projection Games

Advanced Complexity Theory: A Survey of the Complexity of Succinctly Encoded Problems

Advanced Complexity Theory: A Survey of the Complexity of Succinctly Encoded Problems

Advanced Complexity Theory: Descriptive Complexity and Some Unusual Quantifiers

Advanced Complexity Theory: Fourier Analysis and Inapproximability for MAX-CUT: A Case Study

Advanced Complexity Theory: Large Communication Complexity Classes

Advanced Complexity Theory: Multiparty Communication Complexity for Set Disjointness: A Lower Bound

Advanced Complexity Theory: On Polynomial Lower Bounds Based on Complexity of SAT Problems

Course Info

Instructors

Departments

As Taught In

Spring 2016

Level

Graduate

Topics

Learning Resource Types

Lecture Notes

Problem Sets

Projects with Examples

Download Course

MIT Open Learning

Over 2,500 courses & materials

Freely sharing knowledge with learners and educators around the world. Learn more

© 2001–2024 Massachusetts Institute of Technology

Accessibility

Creative Commons License

Terms and Conditions

Proud member of:

© 2001–2024 Massachusetts Institute of Technology