Campus Event Calendar
Event Entry
What and Who
Lower Bounds for Homogeneous Low Depth Formulas
Neeraj Kayal
Microsoft Research India
Talk
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
Expert Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 28 March 2014
10:00
60 Minutes
E2 1 - Bioinformatik
001
Saarbrücken
Abstract
A sequence of works on depth reduction for arithmetic circuits has shown that good enough lower bounds for low depth arithmetic formulas (of depth three or four) would yield superpolynomial lower bounds for general arithmetic circuits. In this talk, we will present some lower bounds for homogeneous depth four arithmetic formulas.
Contact
Markus Bläser
--email hidden
passcode not visible
logged in users only
Christine Kiesel, 03/20/2014 09:16
Christine Kiesel, 03/19/2014 16:45
Christine Kiesel, 03/19/2014 16:36 -- Created document.
Christine Kiesel, 03/19/2014 16:45
Christine Kiesel, 03/19/2014 16:36 -- Created document.