Algorithms for #BIS-Hard Problems on Expander Graphs (2020)
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/19m1286669
Publication URI: http://dx.doi.org/10.1137/19m1286669
Type: Journal Article/Review
Parent Publication: SIAM Journal on Computing
Issue: 4