Students were required to prepare final projects in the form of an in-depth literature review, highlighting a firm understanding of an important development or idea in complexity theory.

Some students agreed to publish their names along with their projects, while others chose to publish anonymously.

- The Zig-Zag Product and USTCON ∈ L (PDF) (Courtesy of Alexandr Wang. Used with permission.)
- Descriptive Complexity and Some Unusual Quantifiers (PDF) (Courtesy of Chelsea Voss. Used with permission.)
- A Survey of the Complexity of Succinctly Encoded Problems (PDF) (Courtesy of anonymous MIT student. Used with permission.)
- Separations between Information and Communication Complexity for Protocols (PDF) (Courtesy of Dimitris Tsipras. Used with permission.)
- Fourier Analysis and Inapproximability for MAX-CUT: A Case Study (PDF) (Courtesy of Jake Wellens. Used with permission.)
- The Polynomial Method and All-Pairs Shortest Paths (PDF) (Courtesy of anonymous MIT student. Used with permission.)
- Quantum computing and #P-complete Problems (PDF) (Courtesy of anonymous MIT student. Used with permission.)
- The Pattern Matrix Method (PDF) (Courtesy of anonymous MIT student. Used with permission.)
- Random Oracles, The Polynomial-Time Hierarchy, and Constant-depth Circuits (PDF) (Courtesy of Andrew He and Lisa Yang. Used with permission.)
- Large Communication Complexity Classes (PDF) (Courtesy of Brian Chen and Ray Hua Wu. Used with permission.)
- A Survey of Parallel Repetition and Projection Games (PDF) (Courtesy of anonymous MIT student. Used with permission.)
- The Clique vs Independent Set Problem and Related Results in Graph Theory (PDF) (Courtesy of Ryan Alweiss and Yang Liu. Used with permission.)
- Multiparty Communication Complexity for Set Disjointness: A Lower Bound (PDF) (Courtesy of Sammy Luo and Brian Shimanuki. Used with permission.)
- On Polynomial Lower Bounds Based on Complexity of SAT Problems (PDF) (Courtesy of anonymous MIT student. Used with permission.)
- Unambiguous Computation (PDF) (Courtesy of Suhas Vijaykumar. Used with permission.)
- Data Structure Lower Bounds via Communication Complexity (PDF) (Courtesy of anonymous MIT student. Used with permission.)