[Colloquium] TODAY: Raghunathan/M.S. Presentation/May 6, 2004

[Margaret Jaffey]

Just a reminder about Nanda Raghunathan's MS Presentation this 
afternoon.

------------------------
Date:  Thursday, May 6, 2004

Time:  3:00 p.m.

Place:  Ryerson 251

M.S. Candidate:  Nandakumar Raghunathan

M.S. Paper Title:  Pseudorandomness and Constant Depth Circuits

Abstract:
Two of the important parameters of a pseudorandom generator are the
complexity of computing the output and complexity of the adversary we 
are
trying to fool. We focus on generators computable by constant depth
circuit in the context of {\em complexity theory}(to derandomize uniform
probabilistic constant depth circuits) and {\em cryptography}(to fool
probabilistic polynomial time adversaries.) We survey results regarding
the possibility and the impossibility of achieving such generators.

Advisor:  Prof. Laszlo Babai

A draft copy of Nanda Raghunathan's MS Paper is available in Ry 161A.

-- 
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
Margaret P. Jaffey				margaret at cs.uchicago.edu
Department of Computer Science
Student Support Rep (Ry 161A)		(773) 702-6011
The University of Chicago		http://www.cs.uchicago.edu
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-