Browsing School of Mathematical Sciences by Author "Galanis, A"
Now showing items 1-5 of 5
-
APPROXIMATELY COUNTING H-COLORINGS IS #BIS-HARD
Galanis, A; Goldberg, LA; Jerrum, M (2016) -
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
Cai, J-Y; Galanis, A; Goldberg, LA; Guo, H; Jerrum, M; Stefankovic, D; Vigoda, E (2016-08) -
A complexity trichotomy for approximately counting list H-colourings
JERRUM, MR; Galanis, A; Goldberg, LA -
Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
Buys, P; Galanis, A; Patel, V; Regts, G (2022) -
Random Walks on Small World Networks
Jerrum, M; Galanis, A; Goldberg, LA; Vigoda, E; Dyer, M (Association for Computing Machinery, 2020-06-01)