Prateek Dwivedi

Prateek Dwivedi is a postdoctoral researcher in the Theory Group at the IT University of Copenhagen, collaborating with Prof. Nutan Limaye. He earned his Ph.D. in 2025 from the Indian Institute of Technology Kanpur under Prof. Nitin Saxena. His research focuses on Theoretical Computer Science, particularly Algebraic Complexity Theory, Graph Theory, and Computational Number Theory.

Research interests include circuit complexity, polynomial identity testing, border complexity, and group testing problems. His work bridges algebraic methods with algorithmic challenges, emphasizing explicit polynomial constructions and bounded-depth circuit analysis.

Recent publications highlight advancements in monotone bounded-depth circuits, deterministic identity testing for depth-4 circuits, and exploration of border complexity in algebraic circuits. These contributions span conferences like STOC, FOCS, MFCS, and CCC, reflecting both depth and breadth in his theoretical investigations.

Collaborations frequently involve co-authors such as C. S. Bhargav, Nitin Saxena, and Pranjal Dutta. He has presented at international venues including workshops in Zinal (Switzerland), STOC, and online seminars, demonstrating active engagement with the global academic community.