Jin-yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda. #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. In Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. Volume 28 of LIPIcs, pages 582-595, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]
@inproceedings{CaiGGGJSV14,
title = {#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region},
author = {Jin-yi Cai and Andreas Galanis and Leslie Ann Goldberg and Heng Guo and Mark Jerrum and Daniel Stefankovic and Eric Vigoda},
year = {2014},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.582},
url = {http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.582},
researchr = {https://researchr.org/publication/CaiGGGJSV14},
cites = {0},
citedby = {0},
pages = {582-595},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain},
editor = {Klaus Jansen and José D. P. Rolim and Nikhil R. Devanur and Cristopher Moore},
volume = {28},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-74-3},
}