Speaker: |
Gorav Jindal (TU Berlin, Germany.) |

Organiser: |
Kumar Saurav |

Date: |
Friday, 11 Jun 2021, 17:15 to 18:15 |

Venue: |

(Scan to add to calendar)

The second part of this work deals with the complexity of computing the truncations of uni-variate polynomials or power series. We first show that the truncations of rational functions are easy to compute. We also prove that the truncations of even very simple algebraic functions are hard to compute, unless integer factoring is easy.

This is a joint work with Pranjal Dutta, Anurag Pandey and Amit Sinhababu. A pre-print can be found at https://eccc.weizmann.ac.il/report/2021/072/ .

Zoom Link: https://zoom.us/j/93889521556?pwd=eEFJWVRtRHNpNlpZWmhNYTJGQTF6Zz09