IMSc Webinar

Heroes Zeros in computational complexity

Anurag Pandey

Saarland University, Germany

Webinar: join at https://zoom.us/j/96565826936?pwd=TzZPcmh6cE5YMDdOWkdWcWFtRFVvUT09 Polynomials, which are finite combinations of additions and multiplications, have been extensively studied for millennia, owing to their simplicity and pervasiveness. One of the most successful approaches to understand them is through the study of their zeros. In this talk, we will see some of the connections between the study of zeros of polynomials and the fundamental problems in computational complexity theory, from the perspective of the speaker's research journey so far.