A short nonalgorithmic proof of the containers theorem for hypergraphs (2018)

First Author: Bernshteyn A

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

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

Type: Preprint