Suryajith Chillara

Orcid: 0000-0003-1119-6152

According to our database1, Suryajith Chillara authored at least 18 papers between 2013 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
From Submodularity to Matrix Determinants: Strengthening Han's, Szász's, and Fischer's Inequalities.
CoRR, May, 2026

Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems.
CoRR, January, 2026

Multilinear Formula Lower Bounds for Sparse Determinants.
Electron. Colloquium Comput. Complex., 2026

2025
Fractional Subadditivity of Submodular Functions: Equality Conditions and Their Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2025

Branching Programs with Extended Memory: New Insights.
Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2023
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2021
On Computing Multilinear Polynomials Using Multi-<i>r</i>-ic Depth Four Circuits.
ACM Trans. Comput. Theory, 2021

Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree.
Inf. Process. Lett., 2020

New Exponential Size Lower Bounds against Depth Four Circuits of Bounded Individual Degree.
Electron. Colloquium Comput. Complex., 2020

On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2018
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2016
The Chasm at Depth Four, and Tensor Rank : Old results, new insights.
Electron. Colloquium Comput. Complex., 2016

2014
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science, 2014

On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Determinantal Complexity of Iterated Matrix Multiplication Polynomial.
CoRR, 2013


  Loading...