activity
20092026
most citedThe computational hardness of counting in two-spin models on d-regular graphs

59 citations · 216 across the 22 of their papers we have counts for

collaborators
Showing 2016 · math.STShow all

Nothing from them under that filter.

Their other years and fields are still on the left.