11 citations · 33 across the 22 of their papers we have counts for
Showing 2017 · cs.CCShow all
2 papers · 2 filters
cs.CC2017★ 2 cited
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps
Krishnamoorthy Dinesh, Jayalal Sarma
The well-known Sensitivity Conjecture states that for any Boolean function , block…
cs.CC2017★ 2 cited
On the Complexity of L-reachability
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
We initiate a complexity theoretic study of the language based graph reachability problem (L-REACH) : Fix a language L. Given a graph whose edges are labeled with alphabet symbols…