scientific article; zbMATH DE number 7561741
From MaRDI portal
Publication:5092461
DOI10.4230/LIPIcs.CCC.2020.13MaRDI QIDQ5092461
Alexandra Kolla, Viresh Patel, Matthew Coulson, Ewan Davies, Guus Regts
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1911.01504
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs ⋮ Metastability of the Potts ferromagnet on random regular graphs
Cites Work
- Unnamed Item
- Spectral algorithms for unique games
- The Ising partition function: zeros and deterministic approximation
- Computing the number of induced copies of a fixed graph in a bounded degree graph
- On the Lambert \(w\) function
- The random-cluster model on a homogeneous tree
- On the hardness of approximating Multicut and Sparsest-Cut
- .879-approximation algorithms for MAX CUT and MAX 2SAT
- How to Play Unique Games on Expanders
- Location of zeros for the partition function of the Ising model on bounded degree graphs
- On the power of unique 2-prover 1-round games
- On the optimality of the random hyperplane rounding technique for MAX CUT
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- Algorithmic Pirogov-Sinai theory
- Towards a proof of the 2-to-1 games conjecture?
- On non-optimally expanding sets in Grassmann graphs
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
This page was built for publication:
