5 citations · 11 across the 11 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020
Graph Homomorphism Polynomials: Algorithms and Complexity
Balagopal Komarath, Anurag Pandey, C. S. Rahul
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph to -vertex graphs. These polynomials have received a lot of at…
cs.CC2020
On the complexity of detecting hazards
Balagopal Komarath, Nitin Saurabh
Detecting and eliminating logic hazards in Boolean circuits is a fundamental problem in logic circuit design. We show that there is no time algorithm…