Hi all,

The 26th Theory Weekly Meeting will happen **this Friday** between **2:00 – 3:00 pm**** **at **203 Davis Hall (Theory Lab)**. The schedule will be as follows :

**2:00 – 3:00 pm **– A talk by Chaowen Guan. The abstract of this talk in his words:

This talk will be demonstrating the connection between the complexity of evaluating polynomials and integer factorization, which was first done by Lipton. We will show a more general result by highlighting the importance of of a global bound on sufficiently many distinct roots of the polynomial. In particular, we can derive tradeoffs between the randomized complexity of factoring and the number of distinct roots. At last, we will also show what could the actual ”defenses” of factoring against efficient attacks.