CS 6816

Last Updated

  • Schedule of Classes - April 8, 2026 7:48PM EDT

CS 6816
Meta-Complexity and Cryptography

Course information provided by the 2025-2026 Catalog.

Meta-complexity refers to the computational complexity of problems that are themselves about computations and their complexity. Such problems include the Minimum Circuit Size Problem and the Time-bounded Kolmogorov Complexity Problem, the study of which originated in the 1950s/60s and predate the modern study of Complexity theory. Meta-complexity provides a unifying framework for a variety of central tasks in several areas of computer science, including computational complexity, cryptography, and learning theory, and there has been a recent explosion of works connecting these areas through the lens of Meta-complexity. In this course, we will focus on these recent development, with a particular focus on connections with Cryptography.


Enrollment Priority Enrollment limited to: Cornell Tech PhD students.

Last 1 Terms Offered 2026SP

View Enrollment Information

Syllabi: none

  •   Seven Week - Second. 

  • 3 Credits GradeNoAud

  • 16348 CS 6816   LEC 001

  •  

  • Instruction Mode: Distance Learning-Asynchronous

Syllabi: none

  •   Seven Week - Second. 

  • 3 Credits GradeNoAud

  • 16349 CS 6816   LEC 030

  •  

  • Instruction Mode: Distance Learning-Asynchronous

    Enrollment limited to Cornell Tech PhD Students. Masters' students may enroll with instructor permission.