📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Algorithms for #BIS-hard problems on expander graphs

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.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