Prateek Dwivedi

According to our database, Prateek Dwivedi authored at least 9 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials.

Prateek Dwivedi, Benedikt Pago, Tim Seppelt

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs.

Robert Andrews, Jules Armand, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025

A primer on the closure of algebraic complexity classes under factoring.

C. S. Bhargav, Prateek Dwivedi, Nitin Saxena

Electron. Colloquium Comput. Complex., 2025

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs.

Jules Armand, Prateek Dwivedi, Nutan Limaye, Magnus Rahbek Dalgaard Hansen, Srikanth Srinivasan, Sébastien Tavenas

Electron. Colloquium Comput. Complex., 2025

Monotone Bounded-Depth Complexity of Homomorphism Polynomials.

C. S. Bhargav, Shiteng Chen, Radu Curticapean, Prateek Dwivedi

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024

Lower Bounds for the Sum of Small-Size Algebraic Branching Programs.

C. S. Bhargav, Prateek Dwivedi, Nitin Saxena

Proceedings of the Theory and Applications of Models of Computation, 2024

Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring.

C. S. Bhargav, Prateek Dwivedi, Nitin Saxena

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2021

Demystifying the border of depth-3 algebraic circuits.

Pranjal Dutta, Prateek Dwivedi, Nitin Saxena

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits.

Pranjal Dutta, Prateek Dwivedi, Nitin Saxena

Proceedings of the 36th Computational Complexity Conference, 2021