2 citations · 3 across the 2 of their papers we have counts for
2 papers
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…
cs.CC2015★ 1 cited
Comparator Circuits over Finite Bounded Posets
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
Comparator circuit model was originally introduced by Mayr and Subramanian (1992) (and further studied by Cook, Filmus and Le (2012)) to capture problems which are not known to be…