CS 6817

Last Updated

  • Schedule of Classes - September 22, 2025 1:06PM EDT

CS 6817
Special Topics in Complexity Theory

Course information provided by the 2025-2026 Catalog.

This course will focus on the 'Analysis of Boolean Functions' with the objective to unravel properties of Boolean functions by studying their Fourier spectra. The harmonic analysis of Boolean functions has become a powerful tool in theoretical computer science, leading to groundbreaking results in various areas such as social choice theory, hardness of approximation, learning theory, pseudorandomness, property testing and circuit complexity. In fact, the tools developed in this area have found key applications beyond computer science, in particular leading to key developments in areas of random graphs, statistical physics, combinatorics and metric spaces. The course will aim to provide an in-depth introduction to this field of study.


Prerequisites CS 4820.

Last 4 Terms Offered 2025SP, 2020FA

View Enrollment Information

Syllabi: none

  •   Regular Academic Session.  Choose one lecture and one project.

  • 4 Credits GradeNoAud

  •  8849 CS 6817   LEC 001

  •  
    • TR
    • Jan 20 - May 5, 2026

    • Chattopadhyay, E

      Elser, A

  • Instruction Mode: In Person

    For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/

  •  9353 CS 6817   PRJ 601

  •  
    • Jan 20 - May 5, 2026

    • Chattopadhyay, E

  • Instruction Mode: In Person