BARC core researcher Research Prize

Nutan's research addresses some of the most fundamental questions in computer science: what can be computed efficiently, what cannot, and how resources such as time, memory, and energy limit what algorithms can achieve. Her work is primarily in computational complexity theory, with a particular focus on algebraic complexity, where the central objects of study are polynomials and the arithmetic circuits that compute them.

Understanding the limits of computation is not only of theoretical interest. As Nutan puts it: "If everything were easy to compute, encryption would be meaningless. The security of our digital world depends on some problems being genuinely difficult."
Since joining ITU five years ago, Nutan has built a strong international research profile. Together with Srikanth Srinivasan and Sébastien Tavenas, she proved the first superpolynomial lower bounds for constant-depth arithmetic circuits, resolving a long-standing open problem in algebraic complexity. The result received the Best Paper Award at FOCS 2021 and has since opened several new lines of research in the field.

The prize recognises both Nutan's scientific contributions and her importance to the research environment at ITU.
"This award is very well deserved," says Thore Husfeldt, head of the Algorithms group at ITU. "Nutan's research is at the core of the theory of computation. I am also very happy that ITU continues to recognise research of the highest international calibre in theoretical computer science, an area that remains one of the most fundamental and consequential disciplines in computing."
Riko Jacob, head of the Theoretical Computer Science section at ITU, adds: "Nutan represents many of the traits we value at ITU: impeccable and ambitious research, an honest commitment to and knack for teaching, and being incredibly pleasant to be around."

Congratulations, Nutan, from all of us at BARC!

Topics