Karthik C. S.

●  Spring'26: Complexity of Computation and Hardness of Approximation (CS 538)

●  Fall'25: Introduction to Computability and Complexity Theory for Master Students (CS 508)

●  Fall'25: Undergraduate Computability and Complexity Theory (CS 452)

●  Spring'25: Undergraduate Computability and Complexity Theory (CS 452)

●  Fall'23: Undergraduate Computability and Complexity Theory (CS 452)

●  Fall'23: Linear Programming and its Application to Approximation Algorithms (CS 521)

●  Spring'23: Introduction to Discrete Structures I (CS 205)

●  Fall'22: Complexity of Computation (CS 538)