Get started
Author

Chandan Saha

Observed names: CHANDAN SAHA, Saha, C, Saha, Chandan
ORCID: 0009-0003-7496-7396
Observed ORCID: 0009-0003-7496-7396
OpenAlex ID: A5101655060
Fast Integer Multiplication Using Modular Arithmetic
2008 · Anindya De, Piyush P. Kurur, et al. · SIAM Journal on Computing · 77
PDF
A super-polynomial lower bound for regular arithmetic formulas
2014 · Neeraj Kayal, Chandan Saha, et al. · ACM Symposium on Theory of Computing (STOC) · 62
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
2014 · Neeraj Kayal, Nutan Limaye, et al. · Annual Symposium on Foundations of Computer Science · 40
Quasi-polynomial hitting-set for set-depth-Δ formulas
2013 · Manindra Agrawal, Chandan Saha, et al. · ACM Symposium on Theory of Computing (STOC) · 40
Jacobian hits circuits
2012 · Manindra Agrawal, Chandan Saha, et al. · ACM Symposium on Theory of Computing (STOC) · 40
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits
2020 · Neeraj Kayal, Vineet Nair, et al. · ACM Transactions on Computation Theory · 24
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
2012 · Chandan Saha, Ramprasad Saptharishi, et al. · Computational Complexity · 21
On the Sum of Square Roots of Polynomials and Related Problems
2011 · Neeraj Kayal, Chandan Saha · IEEE Conference on Computational Complexity (CCC) · 21
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
2017 · Neeraj Kayal, Nutan Limaye, et al. · SIAM Journal on Computing · 18
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
2014 · Neeraj Kayal, Nutan Limaye, et al. · ACM Symposium on Theory of Computing (STOC) · 17
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits
2016 · Manindra Agrawal, Chandan Saha, et al. · SIAM Journal on Computing · 15
Reconstruction of non-degenerate homogeneous depth three circuits
2019 · Neeraj Kayal, Chandan Saha · ACM Symposium on Theory of Computing (STOC) · 13
Lower Bounds for Sums of Powers of Low Degree Univariates
2015 · Neeraj Kayal, Pascal Koiran, et al. · Lecture notes in computer science · 13
Multi-k-ic Depth Three Circuit Lower Bound
2016 · Neeraj Kayal, Chandan Saha · Theory of Computing Systems · 12
PDF
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
2019 · Neeraj Kayal, Vineet Nair, et al. · Computational Complexity · 11
Reconstruction of Full Rank Algebraic Branching Programs
2018 · Neeraj Kayal, Vineet Nair, et al. · ACM Transactions on Computation Theory · 11
Learning sums of powers of low-degree polynomials in the non-degenerate case
2020 · Ankit Garg, Neeraj Kayal, et al. · Annual Symposium on Foundations of Computer Science · 10
PDF
On the size of homogeneous and of depth four formulas with low individual degree
2016 · Neeraj Kayal, Chandan Saha, et al. · ACM Symposium on Theory of Computing (STOC) · 10
Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin
2016 · Neeraj Kayal, Chandan Saha · Computational Complexity · 10
PDF
On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree
2018 · Neeraj Kayal, Chandan Saha, et al. · Theory of Computing · 8
PDF
Lower bounds for depth three arithmetic circuits with small bottom fanin
2015 · Neeraj Kayal, Chandan Saha · 8
The Power of Depth 2 Circuits over Algebras
2009 · Saha, Chandan, Saptharishi, Ramprasad, et al. · arXiv (Cornell University) · 7
PDF
Covering a Set of Points in a Plane Using Two Parallel Rectangles
2007 · Chandan Saha, Sandip Das · International Conference on Computing: Theory and Applications · 7
Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
2012 · Agrawal, Manindra, Saha, Chandan, et al. · arXiv (Cornell University) · 6
PDF
The Power of Depth 2 Circuits over Algebras
2009 · Saha, Chandan, Saptharishi, Ramprasad, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 6
PDF
Works count: 53
Citation count: 544
H-index: 13
I10-index: 19
Year
Topic
Type