Algorithms for #BIS-hard problems on expander graphs
Attributed to:
New approaches to Gibbs measures at the interface of probability and computational complexity
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1137/1.9781611975482.135
Publication URI: http://dx.doi.org/10.1137/1.9781611975482.135
Type: Book Chapter
Book Title: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (2019)
Page Reference: 2235-2247