Course Name: CS6850 : Advances in Complexity Theory

Description: Topics of current interest in Computational Complexity such as coding theory, randomized algorithms and de-randomization techniques, the probabilistic method, PCPs and hardness of approximation, theory of one-way functions and pseudo-randomness, and expander construction and applications, will be covered.

Slot: R

RoomNo:

Instructor: Jayalal Sarma M N

Period: JAN-MAY 2013

This page was created on: Thursday 19th of September 2013 09:43:44 PM