乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:51:11Z","timestamp":1740106271858,"version":"3.37.3"},"reference-count":31,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T00:00:00Z","timestamp":1470009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1217549"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"2013 Simons Award for Graduate Students in Theoretical Computer Science"},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["334828"],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1318374"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1217458"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1016\/j.jcss.2015.11.009","type":"journal-article","created":{"date-parts":[[2015,12,4]],"date-time":"2015-12-04T07:49:48Z","timestamp":1449215388000},"page":"690-711","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region"],"prefix":"10.1016","volume":"82","author":[{"given":"Jin-Yi","family":"Cai","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Galanis","sequence":"additional","affiliation":[]},{"given":"Leslie Ann","family":"Goldberg","sequence":"additional","affiliation":[]},{"given":"Heng","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Vigoda","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2015.11.009_br0010","series-title":"ICALP","first-page":"646","article-title":"The complexity of the counting constraint satisfaction problem","author":"Bulatov","year":"2008"},{"issue":"5","key":"10.1016\/j.jcss.2015.11.009_br0020","doi-asserted-by":"crossref","first-page":"32:1","DOI":"10.1145\/2528401","article-title":"The expressibility of functions on the Boolean domain, with applications to counting CSPs","volume":"60","author":"Bulatov","year":"2013","journal-title":"J. ACM"},{"key":"10.1016\/j.jcss.2015.11.009_br0030","series-title":"STOC","first-page":"909","article-title":"Complexity of counting CSP with complex weights","author":"Cai","year":"2012"},{"key":"10.1016\/j.jcss.2015.11.009_br0040","series-title":"COCOA","first-page":"336","article-title":"Inapproximability after uniqueness phase transition in two-spin systems","author":"Cai","year":"2012"},{"key":"10.1016\/j.jcss.2015.11.009_br0050","series-title":"STOC","first-page":"715","article-title":"Holant problems and counting CSP","author":"Cai","year":"2009"},{"author":"Chen","key":"10.1016\/j.jcss.2015.11.009_br0060"},{"key":"10.1016\/j.jcss.2015.11.009_br0070","series-title":"STACS","first-page":"148","article-title":"The complexity of approximating conservative counting CSPs","author":"Chen","year":"2013"},{"issue":"3","key":"10.1016\/j.jcss.2015.11.009_br0080","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s00453-003-1073-y","article-title":"The relative complexity of approximate counting problems","volume":"38","author":"Dyer","year":"2003","journal-title":"Algorithmica"},{"issue":"3\u20134","key":"10.1016\/j.jcss.2015.11.009_br0090","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.jcss.2009.08.003","article-title":"An approximation trichotomy for Boolean #CSP","volume":"76","author":"Dyer","year":"2010","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.jcss.2015.11.009_br0100","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/100811258","article-title":"An effective dichotomy for the counting constraint satisfaction problem","volume":"42","author":"Dyer","year":"2013","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2015.11.009_br0110","series-title":"APPROX-RANDOM","first-page":"567","article-title":"Improved inapproximability results for counting independent sets in the hard-core model","author":"Galanis","year":"2011"},{"author":"Galanis","key":"10.1016\/j.jcss.2015.11.009_br0120"},{"key":"10.1016\/j.jcss.2015.11.009_br0130","series-title":"STOC","first-page":"823","article-title":"Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region","author":"Galanis","year":"2014"},{"key":"10.1016\/j.jcss.2015.11.009_br0140","series-title":"FSTTCS","first-page":"240","article-title":"A graph polynomial for independent sets of bipartite graphs","author":"Ge","year":"2010"},{"year":"2011","series-title":"Gibbs Measures and Phase Transitions","author":"Georgii","key":"10.1016\/j.jcss.2015.11.009_br0150"},{"issue":"1","key":"10.1016\/j.jcss.2015.11.009_br0160","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1017\/S096354830600767X","article-title":"The complexity of ferromagnetic Ising with local fields","volume":"16","author":"Goldberg","year":"2007","journal-title":"Comb. Probab. Comput."},{"issue":"5","key":"10.1016\/j.jcss.2015.11.009_br0170","first-page":"1","article-title":"A counterexample to rapid mixing of the Ge-\u0160tefankovi\u010d process","volume":"17","author":"Goldberg","year":"2012","journal-title":"Electron. Commun. Probab."},{"issue":"5","key":"10.1016\/j.jcss.2015.11.009_br0180","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/2371656.2371660","article-title":"Approximating the partition function of the ferromagnetic Potts model","volume":"59","author":"Goldberg","year":"2012","journal-title":"J. ACM"},{"author":"Goldberg","key":"10.1016\/j.jcss.2015.11.009_br0190"},{"issue":"2","key":"10.1016\/j.jcss.2015.11.009_br0200","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/rsa.10090","article-title":"The computational complexity of two-state spin systems","volume":"23","author":"Goldberg","year":"2003","journal-title":"Random Struct. Algorithms"},{"issue":"5","key":"10.1016\/j.jcss.2015.11.009_br0210","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1137\/0222066","article-title":"Polynomial-time approximation algorithms for the Ising model","volume":"22","author":"Jerrum","year":"1993","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.jcss.2015.11.009_br0220","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1111\/j.2517-6161.1985.tb01367.x","article-title":"Stochastic models of computer communication systems","volume":"47","author":"Kelly","year":"1985","journal-title":"J. R. Stat. Soc. B"},{"key":"10.1016\/j.jcss.2015.11.009_br0230","series-title":"SODA","first-page":"922","article-title":"Approximate counting via correlation decay in spin systems","author":"Li","year":"2012"},{"key":"10.1016\/j.jcss.2015.11.009_br0240","series-title":"SODA","first-page":"67","article-title":"Correlation decay up to uniqueness in spin systems","author":"Li","year":"2013"},{"author":"Liu","key":"10.1016\/j.jcss.2015.11.009_br0250"},{"key":"10.1016\/j.jcss.2015.11.009_br0260","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s00440-007-0131-9","article-title":"On the hardness of sampling independent sets beyond the tree threshold","volume":"143","author":"Mossel","year":"2009","journal-title":"Probab. Theory Relat. Fields"},{"key":"10.1016\/j.jcss.2015.11.009_br0270","series-title":"SODA","first-page":"941","article-title":"Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs","author":"Sinclair","year":"2012"},{"key":"10.1016\/j.jcss.2015.11.009_br0280","series-title":"FOCS","first-page":"287","article-title":"Computational transition at the uniqueness threshold","author":"Sly","year":"2010"},{"key":"10.1016\/j.jcss.2015.11.009_br0290","series-title":"FOCS","first-page":"361","article-title":"The computational hardness of counting in two-spin models on d-regular graphs","author":"Sly","year":"2012"},{"key":"10.1016\/j.jcss.2015.11.009_br0300","series-title":"STOC","first-page":"140","article-title":"Counting independent sets up to the tree threshold","author":"Weitz","year":"2006"},{"issue":"6","key":"10.1016\/j.jcss.2015.11.009_br0310","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1137\/S0097539794266407","article-title":"On unapproximable versions of NP-complete problems","volume":"25","author":"Zuckerman","year":"1996","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000015001324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000015001324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T21:19:44Z","timestamp":1718227184000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000015001324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["S0022000015001324"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2015.11.009","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[2016,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2015.11.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}