Pseudorandom Generators for Polynomial Threshold Functions

Speaker: Daniel Kane , Stanford University

Date: Monday, November 18, 2013

Time: 4:00 PM to 5:00 PM Note: all times are in the Eastern Time Zone

Public: Yes

Location: 32-G575

Event Type:

Room Description:

Host: Piotr Indyk, MIT

Contact: Joanne Talbot Hanley, 617-253-6054, joanne@csail.mit.edu

Relevant URL:

Speaker URL: None

Speaker Photo:
None

Reminders to: theory-seminars@csail.mit.edu, seminars@csail.mit.edu, compalgsem@lists.csail.mit.edu

Reminder Subject: 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.

Research Areas:

Impact Areas:

See other events that are part of the Algorithms and Complexity Series Fall 2013 / Spring 2014.

Created by Joanne Talbot Hanley Email at Wednesday, October 30, 2013 at 10:37 AM.