Suryajith Chillara

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

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

Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara, Vinod M. Prabhakaran

CoRR, May, 2026

Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems.

Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara, Vinod M. Prabhakaran

CoRR, January, 2026

Multilinear Formula Lower Bounds for Sparse Determinants.

Pruthvi Boyapati, Suryajith Chillara, Pratyush Vempati

Electron. Colloquium Comput. Complex., 2026

2025

Fractional Subadditivity of Submodular Functions: Equality Conditions and Their Applications.

Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara, Vinod M. Prabhakaran

Proceedings of the IEEE International Symposium on Information Theory, 2025

Branching Programs with Extended Memory: New Insights.

Suryajith Chillara, Nithish Raja

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2023

On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts.

Suryajith Chillara, Coral Grichener, Amir Shpilka

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.

Suryajith Chillara

ACM Trans. Comput. Theory, 2021

Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four.

Suryajith Chillara

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.

Suryajith Chillara

Inf. Process. Lett., 2020

New Exponential Size Lower Bounds against Depth Four Circuits of Bounded Individual Degree.

Suryajith Chillara

Electron. Colloquium Comput. Complex., 2020

On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits.

Suryajith Chillara

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.

Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas.

Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits.

Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan

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.

Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay

Electron. Colloquium Comput. Complex., 2016

2014

Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach.

Suryajith Chillara, Partha Mukhopadhyay

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.

Suryajith Chillara, Partha Mukhopadhyay

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Determinantal Complexity of Iterated Matrix Multiplication Polynomial.

Suryajith Chillara, Partha Mukhopadhyay

CoRR, 2013