{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T20:26:04Z","timestamp":1791318364614,"version":"4.3.1"},"reference-count":11,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2002,1]]},"abstract":"<jats:p>We prove two results concerning approximate counting of independent sets in graphs with constant maximum degree $\\Delta$. The first implies that the Markov chain Monte Carlo technique is likely to fail if $\\Delta \\geq 6$. The second shows that no fully polynomial randomized approximation scheme can exist for $\\Delta \\geq 25$, unless $\\mathrm{RP}=\\mathrm{NP}$.<\/jats:p>","DOI":"10.1137\/s0097539701383844","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1527-1541","source":"Crossref","is-referenced-by-count":75,"title":["On Counting Independent Sets in Sparse Graphs"],"prefix":"10.1137","volume":"31","author":[{"given":"Martin","family":"Dyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2012,2,17]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90118-6"},{"key":"R2","unstructured":"P. Berman and M. Karpinski,\n                      On Some Tighter Inapproximability Results, Further Improvements\n                      , Electronic Colloquium on Computational Complexity, Report TR98\u2010065, 1998."},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1999.1899"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"M. Dyer, A. Frieze, and M. Jerrum,\n                      On counting independent sets in sparse graphs\n                      , in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS\u201999), IEEE Computer Society Press, Los Alamitos, CA, 1999, pp. 210\u2013217.","DOI":"10.1109\/SFFCS.1999.814593"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1071"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030402"},{"key":"R8","unstructured":"M. Jerrum and A. Sinclair,\n                      The Markov chain Monte Carlo method: An approach to approximate counting and integration\n                      , in Approximation Algorithms for NP\u2010Hard Problems, D. Hochbaum, ed., PWS Publishing, Boston, 1996, pp. 482\u2013520."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"M. Luby and E. Vigoda,\n                      Approximately counting up to four\n                      , in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1997, pp. 682\u2013687.","DOI":"10.1145\/258533.258663"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Johan H\u00e5stad, Some optimal inapproximability results, ACM, New York, 1999, 1\u2013101715618","DOI":"10.1145\/258533.258536"},{"key":"R11","volume-title":"Computational complexity","author":"Papadimitriou Christos","year":"1994"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539701383844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:22:22Z","timestamp":1787336542000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539701383844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["10.1137\/S0097539701383844"],"URL":"https:\/\/doi.org\/10.1137\/s0097539701383844","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}