Chandan Saha
Chandan Saha
Indian Institute of Science
Verified email at iisc.ac.in - Homepage
Title
Cited by
Cited by
Year
Simpler algorithm for estimating frequency moments of data streams
L Bhuvanagiri, S Ganguly, D Kesh, C Saha
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
1072006
Fast integer multiplication using modular arithmetic
A De, PP Kurur, C Saha, R Saptharishi
SIAM Journal on Computing 42 (2), 685-699, 2013
94*2013
A super-polynomial lower bound for regular arithmetic formulas
N Kayal, C Saha, R Saptharishi
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
762014
An exponential lower bound for homogeneous depth four arithmetic formulas
N Kayal, N Limaye, C Saha, S Srinivasan
SIAM Journal on Computing 46 (1), 307-335, 2017
712017
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth- Occur- Formulas and Depth-3 Transcendence Degree- Circuits
M Agrawal, C Saha, R Saptharishi, N Saxena
SIAM Journal on Computing 45 (4), 1533-1562, 2016
652016
Quasi-polynomial hitting-set for set-depth-Δ formulas
M Agrawal, C Saha, N Saxena
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
452013
Lower bounds for depth-three arithmetic circuits with small bottom fanin
N Kayal, C Saha
computational complexity 25 (2), 419-454, 2016
282016
A case of depth-3 identity testing, sparse factorization and duality
C Saha, R Saptharishi, N Saxena
Computational Complexity 22 (1), 39-69, 2013
282013
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
N Kayal, N Limaye, C Saha, S Srinivasan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
222014
Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits
N Kayal, V Nair, C Saha
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016
202016
The power of depth 2 circuits over algebras
C Saha, R Saptharishi, N Saxena
arXiv preprint arXiv:0904.2058, 2009
202009
Practical algorithms for tracking database join sizes
S Ganguly, D Kesh, C Saha
International Conference on Foundations of Software Technology and …, 2005
182005
On the size of homogeneous and of depth four formulas with low individual degree
N Kayal, C Saha, S Tavenas
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
172016
An almost cubic lower bound for depth three arithmetic circuits
N Kayal, C Saha, S Tavenas
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
172016
Lower bounds for sums of powers of low degree univariates
N Kayal, P Koiran, T Pecatte, C Saha
International Colloquium on Automata, Languages, and Programming, 810-821, 2015
172015
On the sum of square roots of polynomials and related problems
N Kayal, C Saha
ACM Transactions on Computation Theory (TOCT) 4 (4), 1-15, 2012
172012
Covering a set of points in a plane using two parallel rectangles
C Saha, S Das
Information processing letters 109 (16), 907-912, 2009
162009
Reconstruction of full rank algebraic branching programs
N Kayal, V Nair, C Saha, S Tavenas
ACM Transactions on Computation Theory (TOCT) 11 (1), 1-56, 2018
152018
Multi-k-ic depth three circuit lower bound
N Kayal, C Saha
Theory of Computing Systems 61 (4), 1237-1251, 2017
102017
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
N Kayal, V Nair, C Saha
computational complexity 28 (4), 749-828, 2019
72019
The system can't perform the operation now. Try again later.
Articles 1–20