Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChandan Saha 0001
Person information
- affiliation: Indian Institute of Science, Department of Computer Science and Automation, India
Other persons with the same name
- Chandan Saha 0002 — Indiana University School of Medicine, Department of Biostatistics, USA
- Chandan Saha 0003 — Khulna University of Engineering & Technology, Bangladesh
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j13]Neeraj Kayal, Vineet Nair, Chandan Saha:
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits. ACM Trans. Comput. Theory 12(1): 2:1-2:27 (2020)- 2019
- [j12]Neeraj Kayal, Vineet Nair, Chandan Saha:
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs. Comput. Complex. 28(4): 749-828 (2019) - [j11]Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of Full Rank Algebraic Branching Programs. ACM Trans. Comput. Theory 11(1): 2:1-2:56 (2019) - 2018
- [j10]Neeraj Kayal, Chandan Saha:
Guest Column: A Paradigm for Arithmetic Circuit Lower Bounds. SIGACT News 49(1): 55-65 (2018) - [j9]Neeraj Kayal, Chandan Saha, Sébastien Tavenas:
On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree. Theory Comput. 14(1): 1-46 (2018) - 2017
- [j8]Neeraj Kayal, Chandan Saha:
Multi-k-ic Depth Three Circuit Lower Bound. Theory Comput. Syst. 61(4): 1237-1251 (2017) - [j7]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
:
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. SIAM J. Comput. 46(1): 307-335 (2017) - 2016
- [j6]Neeraj Kayal, Chandan Saha:
Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin. Comput. Complex. 25(2): 419-454 (2016) - [j5]Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. SIAM J. Comput. 45(4): 1533-1562 (2016) - 2013
- [j4]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Comput. Complex. 22(1): 39-69 (2013) - [j3]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication Using Modular Arithmetic. SIAM J. Comput. 42(2): 685-699 (2013) - 2012
- [j2]Neeraj Kayal, Chandan Saha:
On the Sum of Square Roots of Polynomials and Related Problems. ACM Trans. Comput. Theory 4(4): 9:1-9:15 (2012) - 2009
- [j1]Chandan Saha, Sandip Das:
Covering a set of points in a plane using two parallel rectangles. Inf. Process. Lett. 109(16): 907-912 (2009)
Conference and Workshop Papers
- 2024
- [c30]Omkar Baraskar, Agrim Dewan, Chandan Saha:
Testing Equivalence to Design Polynomials. STACS 2024: 9:1-9:22 - 2023
- [c29]Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey:
Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. ICALP 2023: 12:1-12:20 - [c28]Nikhil Gupta, Chandan Saha, Bhargav Thankey:
Equivalence Test for Read-Once Arithmetic Formulas. SODA 2023: 4205-4272 - 2022
- [c27]Vishwas Bhargava, Ankit Garg, Neeraj Kayal, Chandan Saha:
Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case. APPROX/RANDOM 2022: 21:1-21:22 - 2021
- [c26]Chandan Saha, Bhargav Thankey:
Hitting Sets for Orbits of Circuit Classes and Polynomial Families. APPROX-RANDOM 2021: 50:1-50:26 - 2020
- [c25]Nikhil Gupta, Chandan Saha, Bhargav Thankey:
A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits. CCC 2020: 23:1-23:31 - [c24]Ankit Garg, Neeraj Kayal, Chandan Saha:
Learning sums of powers of low-degree polynomials in the non-degenerate case. FOCS 2020: 889-899 - [c23]Janaky Murthy, Vineet Nair, Chandan Saha:
Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests. MFCS 2020: 72:1-72:16 - 2019
- [c22]Ankit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha:
Determinant Equivalence Test over Finite Fields and over Q. ICALP 2019: 62:1-62:15 - [c21]Nikhil Gupta, Chandan Saha:
On the Symmetries of and Equivalence Test for Design Polynomials. MFCS 2019: 53:1-53:16 - [c20]Neeraj Kayal, Chandan Saha:
Reconstruction of non-degenerate homogeneous depth three circuits. STOC 2019: 413-424 - 2017
- [c19]Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of Full Rank Algebraic Branching Programs. CCC 2017: 21:1-21:61 - 2016
- [c18]Neeraj Kayal, Chandan Saha, Sébastien Tavenas:
An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits. ICALP 2016: 33:1-33:15 - [c17]Neeraj Kayal, Vineet Nair, Chandan Saha:
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. STACS 2016: 46:1-46:15 - [c16]Neeraj Kayal, Chandan Saha, Sébastien Tavenas:
On the size of homogeneous and of depth four formulas with low individual degree. STOC 2016: 626-632 - 2015
- [c15]Neeraj Kayal, Chandan Saha:
Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin. CCC 2015: 158-208 - [c14]Neeraj Kayal, Pascal Koiran, Timothée Pecatte, Chandan Saha:
Lower Bounds for Sums of Powers of Low Degree Univariates. ICALP (1) 2015: 810-821 - [c13]Neeraj Kayal, Chandan Saha:
Multi-k-ic Depth Three Circuit Lower Bound. STACS 2015: 527-539 - 2014
- [c12]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. FOCS 2014: 61-70 - [c11]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. STOC 2014: 119-127 - [c10]Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi:
A super-polynomial lower bound for regular arithmetic formulas. STOC 2014: 146-153 - 2013
- [c9]Manindra Agrawal, Chandan Saha, Nitin Saxena:
Quasi-polynomial hitting-set for set-depth-Δ formulas. STOC 2013: 321-330 - 2012
- [c8]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 - 2011
- [c7]Neeraj Kayal, Chandan Saha:
On the Sum of Square Roots of Polynomials and Related Problems. CCC 2011: 292-299 - 2009
- [c6]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
The Power of Depth 2 Circuits over Algebras. FSTTCS 2009: 371-382 - 2008
- [c5]Chandan Saha:
Factoring Polynomials over Finite Fields using Balance Test. STACS 2008: 609-620 - [c4]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast integer multiplication using modular arithmetic. STOC 2008: 499-506 - 2007
- [c3]Chandan Saha, Sandip Das:
Covering a Set of Points in a Plane Using Two Parallel Rectangles. ICCTA 2007: 214-218 - 2006
- [c2]Lakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, Chandan Saha:
Simpler algorithm for estimating frequency moments of data streams. SODA 2006: 708-713 - 2005
- [c1]Sumit Ganguly, Deepanjan Kesh, Chandan Saha:
Practical Algorithms for Tracking Database Join Sizes. FSTTCS 2005: 297-309
Informal and Other Publications
- 2024
- [i36]Omkar Baraskar, Agrim Dewan, Chandan Saha:
Testing equivalence to design polynomials. Electron. Colloquium Comput. Complex. TR24: TR24-004 (2024) - 2022
- [i35]Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey:
Low-depth arithmetic circuit lower bounds via shifted partials. CoRR abs/2211.07691 (2022) - [i34]Nikhil Gupta, Chandan Saha, Bhargav Thankey:
Equivalence Test for Read-Once Arithmetic Formulas. Electron. Colloquium Comput. Complex. TR22 (2022) - [i33]Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey:
Low-depth arithmetic circuit lower bounds via shifted partials. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i32]Vishwas Bhargava, Ankit Garg, Neeraj Kayal, Chandan Saha:
Learning generalized depth-three arithmetic circuits in the non-degenerate case. Electron. Colloquium Comput. Complex. TR21 (2021) - [i31]Chandan Saha, Bhargav Thankey:
Hitting Sets for Orbits of Circuit Classes and Polynomial Families. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i30]Ankit Garg, Neeraj Kayal, Chandan Saha:
Learning sums of powers of low-degree polynomials in the non-degenerate case. CoRR abs/2004.06898 (2020) - [i29]Janaky Murthy, Vineet Nair, Chandan Saha:
Randomized polynomial-time equivalence between determinant and trace-IMM equivalence tests. CoRR abs/2006.08272 (2020) - [i28]Ankit Garg, Neeraj Kayal, Chandan Saha:
Learning sums of powers of low-degree polynomials in the non-degenerate case. Electron. Colloquium Comput. Complex. TR20 (2020) - [i27]Nikhil Gupta, Chandan Saha, Bhargav Thankey:
A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR20 (2020) - [i26]Janaky Murthy, Vineet Nair, Chandan Saha:
Randomized polynomial-time equivalence between determinant and trace-IMM equivalence tests. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [i25]Ankit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha:
Determinant equivalence test over finite fields and over ℚ. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i24]Nikhil Gupta, Chandan Saha:
On the symmetries of design polynomials. Electron. Colloquium Comput. Complex. TR18 (2018) - [i23]Neeraj Kayal, Vineet Nair, Chandan Saha:
Average-case linear matrix factorization and reconstruction of low width Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i22]Neeraj Kayal, Chandan Saha:
Reconstruction of non-degenerate homogeneous depth three circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i21]Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of full rank Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i20]Neeraj Kayal, Chandan Saha, Sébastien Tavenas:
An almost Cubic Lower Bound for Depth Three Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i19]Neeraj Kayal, Vineet Nair, Chandan Saha:
Separation between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - [i18]Neeraj Kayal, Chandan Saha:
Multi-k-ic depth three circuit lower bound. Electron. Colloquium Comput. Complex. TR15 (2015) - [i17]Neeraj Kayal, Chandan Saha:
Lower Bounds for Sums of Products of Low arity Polynomials. Electron. Colloquium Comput. Complex. TR15 (2015) - [i16]Neeraj Kayal, Chandan Saha, Sébastien Tavenas:
On the size of homogeneous and of depth four formulas with low individual degree. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i15]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. Electron. Colloquium Comput. Complex. TR14 (2014) - [i14]Neeraj Kayal, Chandan Saha:
Lower Bounds for Depth Three Arithmetic Circuits with small bottom fanin. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i13]Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi:
A super-polynomial lower bound for regular arithmetic formulas. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i12]Manindra Agrawal, Chandan Saha, Nitin Saxena:
Quasi-polynomial Hitting-set for Set-depth-Delta Formulas. CoRR abs/1209.2333 (2012) - [i11]Manindra Agrawal, Chandan Saha, Nitin Saxena:
Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i10]Michael Forbes, Neeraj Kayal, Rajat Mittal, Chandan Saha:
Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant. CoRR abs/1104.4557 (2011) - [i9]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) - [i8]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. Electron. Colloquium Comput. Complex. TR11 (2011) - [i7]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i6]Neeraj Kayal, Chandan Saha:
On the Sum of Square Roots of Polynomials and related problems. Electron. Colloquium Comput. Complex. TR10 (2010) - 2009
- [i5]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
The Power of Depth 2 Circuits over Algebras. CoRR abs/0904.2058 (2009) - [i4]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
The Power of Depth 2 Circuits over Algebras. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [i3]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication using Modular Arithmetic. CoRR abs/0801.1416 (2008) - [i2]Chandan Saha:
Factoring Polynomials over Finite Fields using Balance Test. CoRR abs/0802.2838 (2008) - [i1]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication using Modular Arithmetic. Electron. Colloquium Comput. Complex. TR08 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
