Topic: |
On Multivariate Polynomial Factorization |

Speaker: |
Mr. Chi-Ning Chou (Computer Science, Harvard University) |

Date: |
2019-05-28 (Tue) 10:00 – 12:00 |

Location: |
Auditorium106 at IIS new Building |

Host: |
Kai-Min Chung |

**Abstract:**
Multivariate polynomial factorization is one of the fundamental questions in algebraic complexity. Given a multivariate polynomial f in the form of a succinct representation (e.g., arithmetic circuit), the task is finding a succinct representation for its factors. In addition to being a natural question, polynomial factorization has many applications such as hardness versus randomness and decoding Reed-Solomon codes.

This talk aims to give a broad overview on the multivariate polynomial factorization with a focus on some recent advances and open problems. If time allows, I will also mention the interplay between polynomial factorization and other areas of theoretical computer science. For the audience, no background is required except the definition of polynomia