Publications
-
Constant-depth circuits for polynomial GCD over any characteristic
-
Closure under factorization from a result of Furstenberg
-
Deterministic factorization of constant-depth algebraic circuits in subexponential time
-
An exposition of recent list-size bounds of FRS Codes
-
An Improved Line-Point Low-Degree Test
-
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
-
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits
-
Fast Numerical Multivariate Multipoint Evaluation
-
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes
-
If VNP is hard, then so are equations for it
-
COVID-19 Epidemic in Mumbai: Projections, full economic opening, and containment zones versus contact tracing and testing: An Update
-
City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic
- With Shubhada Agrawal,
Siddharth Bhandari,
Anirban Bhattacharjee,
Anand Deo,
Narendra M Dixit,
Prahladh Harsha,
Sandeep Juneja,
Poonam Kesarwani,
Aditya Krishna Swamy,
Preetam Patil,
Nihesh Rathod,
Sharad Sriram,
Piyush Srivastava,
Rajesh Sundaresan,
Nidhin Koshy Vaidhiyan,
A Y Sarath
- Manuscript. Code available at github.
-
COVID-19 Epidemic Study II: Phased Emergence from the Lockdown in Mumbai
-
On the Existence of Algebraically Natural Proofs
-
A note on the elementary HDX construction of Kaufman-Oppenheim
-
Derandomization from Algebraic Hardness (borderless)
-
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits
-
Constructing Faithful Homomorphisms over Fields of Finite Characteristic
-
Near-optimal Bootstrapping of Hitting Sets for Algebraic Models
-
Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees
-
Finer separations between shallow arithmetic circuits
-
An exponential lower bound for homogeneous depth-5 circuits over finite fields
-
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
-
Identity testing and lower bounds for read-k oblivious algebraic branching programs
-
Efficiently decoding Reed-Muller codes from random errors
-
The Chasm at Depth Four, and Tensor Rank : Old results, new insights
-
On Fortification of Projection Games
-
(Github survey) A selection of lower bounds in arithmetic circuit complexity
-
Recent Progress on Arithmetic Circuit Lower Bounds
-
A selection of lower bounds for arithmetic circuits
- With Neeraj Kayal
- Perspectives in Complexity Theory 2014
- Special issue in the event of Somenath Biswas' 60th Birthday.
-
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order
-
A super-polynomial lower bound for regular arithmetic formulas
-
Unified Approaches to Polynomial Identity Testing and Lower Bounds
- Ph.D. Thesis (2013)
- Won the ACM (India) Doctoral Dissertation Award 2013
-
Arithmetic circuits: A chasm at depth three
-
Approaching the chasm at depth four
-
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
-
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
-
Classifying polynomials and identity testing
-
Arithmetic Circuits and Identity Testing
-
The Power of Depth 2 Circuits over Algebras
-
Fast Integer Multiplication Using Modular Computation