CS Events Monthly View

Seminar

Some closure results for polynomial factorization

 

Download as iCal file

Wednesday, February 21, 2018, 11:00am
 

In a sequence of extremely fundamental results in the 80's, Kaltofen showed that any factor of n-variatepolynomial with degree and arithmetic circuit size poly(n) has an arithmetic circuit of sizepoly(n). In other words, the complexity class VP is

Speaker: Mrinal Kumar

Bio

NULL

Location : CoRE 301

Committee: 

Pranjal Awasthi and Shubhangi Saraf

Event Type: Seminar

Abstract: 

Organization: 

Harvard