报告题目：Counting Roots Modulo Prime Powers: An update

报告人：程岐

报告时间：2019年8月1日，9:00-10:30

报告地点：知新楼B座1219报告厅

摘要：Suppose $p$ is a prime and $ t $ is a positive integer. In this talk, we show that the number of roots in $\Z/(p^t)$ of $f$ can be found in deterministic time $(d t \log p)^{O(1)}$, where $ f \in \Z [x]$ with coefficients of absolute value $< p^t$.

报告人简介：Dr. Qi Cheng is a Williams Company Foundation Presidential Professor in the School of Computer Science at the University of Oklahoma, where he joined in 2001. He received his PhD in Computer Science from University of Southern California in 2001. His research interests are in the areas of theoretical computer science, DNA/molecular computing, cryptography and computational number theory. He has published over 30 research articles in journals and conference proceedings.

邀请人：王明强