Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits-Reference-Cited by-同舟云学术

Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits

Published:2017-03-24 Issue:4 Volume:38 Page:987-1015
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Regts Guus

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/article/10.1007/s00493-016-3506-7/fulltext.html

Reference40 articles.

1. M. Abért and T. Hubai: Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs, Combinatorica 35 (2015), 127–151.

2. I. Arad and Z. Landau: Quantum computation and the evaluation of tensor networks, SIAM Journal on Computing 39 (2010), 3089–3121.

3. M. Bayati, D. Gamarnik, D. Katz, C. Nair and P. Tetali: Simple deterministic approximation algorithms for counting matchings, in: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing 122–127, ACM, 2007.

4. A. Barvinok: Computing the permanent of (some) complex matrices, Foundations of Computational Mathematics (2014), 1–14.

5. A. Barvinok: Computing the partition function for cliques in a graph, Theory of Computing 11 (2015), 339–355.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the zeroes of hypergraph independence polynomials;Combinatorics, Probability and Computing;2023-09-21

2. Zeros and approximations of Holant polynomials on the complex plane;computational complexity;2022-07-27

3. Spectral Independence via Stability and Applications to Holant-Type Problems;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

4. On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs;Annales de l’Institut Henri Poincaré D;2021-09-22

5. Zeros of Holant Problems;ACM Transactions on Algorithms;2021-01-31