Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard.

Andreas Galanis Leslie Ann Goldberg Mark Jerrum

Published in: SIAM J. Comput. (2016)

Keyphrases

graph coloring
search engine
object recognition
mobile robot
hard problems