default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuryajith Chillara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c8]Suryajith Chillara, Coral Grichener, Amir Shpilka
:
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. STACS 2023: 22:1-22:20- 2022
- [i15]Suryajith Chillara, Coral Grichener, Amir Shpilka:
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. CoRR abs/2207.10588 (2022) - [i14]Suryajith Chillara, Coral Grichener, Amir Shpilka:
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j5]Suryajith Chillara:
On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. ACM Trans. Comput. Theory 13(3): 16:1-16:21 (2021) - [c7]Suryajith Chillara:
Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four. FSTTCS 2021: 14:1-14:15 - [i13]Suryajith Chillara:
Functional lower bounds for restricted arithmetic circuits of depth four. CoRR abs/2107.09703 (2021) - [i12]Suryajith Chillara:
Functional lower bounds for restricted arithmetic circuits of depth four. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j4]Suryajith Chillara:
Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree. Inf. Process. Lett. 156: 105900 (2020) - [c6]Suryajith Chillara:
On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. STACS 2020: 47:1-47:16 - [i11]Suryajith Chillara:
New Exponential Size Lower Bounds against Depth Four Circuits of Bounded Individual Degree. CoRR abs/2003.05874 (2020) - [i10]Suryajith Chillara:
On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. Electron. Colloquium Comput. Complex. TR20 (2020) - [i9]Suryajith Chillara:
New Exponential Size Lower Bounds against Depth Four Circuits of Bounded Individual Degree. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j3]Suryajith Chillara, Partha Mukhopadhyay:
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. Comput. Complex. 28(4): 545-572 (2019) - [j2]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications. SIAM J. Comput. 48(1): 70-92 (2019) - 2018
- [c5]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. FOCS 2018: 934-945 - [c4]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. ICALP 2018: 36:1-36:13 - [c3]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. STACS 2018: 21:1-21:15 - [i8]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. CoRR abs/1804.02520 (2018) - [i7]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j1]Suryajith Chillara, Partha Mukhopadhyay:
On the limits of depth reduction at depth 3 over small finite fields. Inf. Comput. 256: 35-44 (2017) - [i6]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. CoRR abs/1710.05481 (2017) - [i5]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i4]Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay:
The Chasm at Depth Four, and Tensor Rank : Old results, new insights. CoRR abs/1606.04200 (2016) - [i3]Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay:
The Chasm at Depth Four, and Tensor Rank : Old results, new insights. Electron. Colloquium Comput. Complex. TR16 (2016) - 2014
- [c2]Suryajith Chillara, Partha Mukhopadhyay:
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. MFCS (2) 2014: 177-188 - [c1]Suryajith Chillara, Partha Mukhopadhyay:
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. STACS 2014: 239-250 - [i2]Suryajith Chillara, Partha Mukhopadhyay:
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. CoRR abs/1401.0189 (2014) - 2013
- [i1]Suryajith Chillara, Partha Mukhopadhyay:
Determinantal Complexity of Iterated Matrix Multiplication Polynomial. CoRR abs/1308.1640 (2013)
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-24 22:48 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:
