Amineh Dadsetan
YOU?
Author Swipe
View article: Counting homomorphisms in plain exponential time
Counting homomorphisms in plain exponential time Open
In the counting Graph Homomorphism problem (#GraphHom) the question is: Given graphs G,H, find the number of homomorphisms from G to H. This problem is generally #P-complete, moreover, Cygan et al. proved that unless the ETH is false there…