Your search returned the following 6 documents:

6. A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
   Chandan Saha, Ramprasad Saptharishi, and Nitin Saxena
   Computational Complexity 22 (1): 39-69, 2013
   
   
5. A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
   Manindra Agrawal, Chandan Saha, and Nitin Saxena
   In: 45th ACM Symposium on the Theory of Computing (STOC-13), Palo Alto, USA, 2013
   
4. On the Sum of Square Roots of Polynomials and Related Problems
   Neeraj Kayal and Chandan Saha
   In: 26th IEEE Conference on Computational Complexity (CCC), San Jose, USA, 2011, 292-299
   
   
3. Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
   Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, and Nitin Saxena
   In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, New York, NY, 2012, 599-614
   
   
2. On the Sum of Square Roots of Polynomials and Related Problems
   Neeraj Kayal and Chandan Saha
   The ACM Transactions on Computation Theory 4 (4): 9:1-9:15, 2012
   
   
1. Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
   Manindra Agrawal, Chandan Saha, and Nitin Saxena
   arXiv abs/1209.2333: 1-13, 2012