Research Publications/ReportsListing last 25 publications. (View All) View/Hide Filter
- Sensitivity, Affine Transforms and Quantum Communication Complexity
- Characterization and Lower Bounds for Branching Program Size using Projective Dimension
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma, Appeared in ACM Transactions on Computation Theory, Vol 11, No.8, Mar 2019. A preliminary version appeared in 36th International Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2016.
- Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps
Krishnamoorthy Dinesh, Jayalal Sarma, Appeared in Theoretical Computer Science, Mar 2019. A preliminary version appeared in 4th Annual Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2018), Feb 2018.
- New Bounds for Energy Complexity of Boolean Functions