Arithmetic Complexity is a central topic of interest in theoretical computer science. The famous $P$ vs. $NP$ question that seeks to understand the limits of efficient computation has its natural arithmetic analogue. Very recently, breakthrough progress on this question has been achieved in a series of works done by several groups of researchers. This workshop proposes to bring together some of the key contributors of these developments from both India and abroad. It is hoped that this would result in a timely exchange of ideas among researchers. It will also allow interaction of the TIFR faculty and graduate students directly with the experts of the field.
