Algorithms for #BIS-hard problems on expander graphs (2018)

First Author: Jenssen M

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.48550/arxiv.1807.04804

Publication URI: https://arxiv.org/abs/1807.04804

Type: Preprint