Nitin Saxena completed his Bachelors in Computer Science from the IIT, Kanpur in 2002 and completed PhD under Manindra Agrawal in 2006. His research interests are computational complexity theory, algebra, geometry and number theory. He was awarded the Distinguished Alumnus Award of the IIT, Kanpur in 2003 for his work in computational complexity theory. He was appointed at the Centrum Wiskunde & Informatica (CWI) starting as a postdoc researcher from September 2006 onwards. He was a Bonn Junior Fellow at the University of Bonn from Summer 2008 onwards. He joined the Department of Computer Science and Engineering at IIT Kanpur as faculty in April 2013. Nitin Saxena was elected Fellow of IASc in 2021.
Session 1B: Inaugural Lectures by Fellows/Associates
R R Navalgund, Bengaluru
Algebra Powers Computation
Modern economies run on algorithms, and algebra is a natural ally in algorithm design. This work deals with the mathematics that goes inside algorithms. The results fall into two broad categories – algebraic circuit properties and fast algorithms for algebra questions. In algebraic circuit theory, the problems of zero-testing, hitting sets, bootstrapping of variables, incidence geometry in identities, duality in circuits, sum-of-squares of univariates, and border circuits will be discussed. Among the algebraic algorithms developed, those related to primality testing, algebraic dependence, approximative roots, all-roots Newton iteration, factoring, root-finding over Galois ring, and Igusa’s local zeta function will be explained.