5 citations · 11 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017★ 5 cited
On the complexity of hazard-free circuits
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen +3
The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows th…
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…