Pseudorandom Generators for Polynomial Threshold Functions
, Stanford University
Date: Monday, November 18, 2013
Time: 4:00 PM to 5:00 PM Note: all times are in the Eastern Time Zone
Host: Piotr Indyk, MIT
Contact: Joanne Talbot Hanley, 617-253-6054, firstname.lastname@example.org
Speaker URL: None
email@example.com, firstname.lastname@example.org, email@example.com
TALK: Special Algorithms and Complexity Seminar: Pseudorandom Generators for Polynomial Threshold Functions by Daniel Kane
We study several developments in the construction of explicit pseudorandom generators for polynomial threshold functions, with particular emphasis on a recent result producing a seed length subpolynomial in the error parameter.
Created by Joanne Talbot Hanley at Wednesday, October 30, 2013 at 10:37 AM.