- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j1 |      | Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Computational Complexity 22(1): 39-69 (2013) |
| i9 | | Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi: Arithmetic circuits: A chasm at depth three. Electronic Colloquium on Computational Complexity (ECCC) 20: 26 (2013) |
| 2012 | ||
| c3 | | Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. STOC 2012: 599-614 |
| i8 | | Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi: An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin. Electronic Colloquium on Computational Complexity (ECCC) 19: 98 (2012) |
| 2011 | ||
| i7 | | Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. CoRR abs/1111.0582 (2011) |
| i6 | | Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Electronic Colloquium on Computational Complexity (ECCC) 18: 21 (2011) |
| i5 | | Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. Electronic Colloquium on Computational Complexity (ECCC) 18: 143 (2011) |
| 2009 | ||
| c2 | | Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: The Power of Depth 2 Circuits over Algebras. FSTTCS 2009: 371-382 |
| i4 | | Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: The Power of Depth 2 Circuits over Algebras. CoRR abs/0904.2058 (2009) |
| i3 | | Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: The Power of Depth 2 Circuits over Algebras. Electronic Colloquium on Computational Complexity (ECCC) 16: 36 (2009) |
| 2008 | ||
| c1 | | Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi: Fast integer multiplication using modular arithmetic. STOC 2008: 499-506 |
| i2 | | Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi: Fast Integer Multiplication using Modular Arithmetic. CoRR abs/0801.1416 (2008) |
| i1 | | Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi: Fast Integer Multiplication using Modular Arithmetic. Electronic Colloquium on Computational Complexity (ECCC) 15(023) (2008) |
| 1 | Manindra Agrawal | |
| 2 | Anindya De | |
| 3 | Ankit Gupta | |
| 4 | Pritish Kamath | |
| 5 | Neeraj Kayal | |
| 6 | Piyush P. Kurur | |
| 7 | Chandan Saha | |
| 8 | Nitin Saxena |
Data released under the ODC-BY 1.0 license — See also our legal information page