{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:46:20Z","timestamp":1725795980151},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084039"},{"type":"electronic","value":"9783319084046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08404-6_33","type":"book-chapter","created":{"date-parts":[[2014,6,25]],"date-time":"2014-06-25T03:55:08Z","timestamp":1403668508000},"page":"380-391","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Counting of Matchings in (3,3)-Hypergraphs"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Dudek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edyta","family":"Szyma\u0144ska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Bayati, M., Gamarnik, D., Katz, D., Nair, C., Tetali, P.: Simple deterministic approximation algorithms for counting matchings. In: STOC 2007\u2014Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 122\u2013127. ACM (2007)","DOI":"10.1145\/1250790.1250809"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Bayati, M., Gamarnik, D., Katz, D., Nair, C., Tetali, P.: Simple deterministic approximation algorithms for counting matchings (2008), \n                  \n                    http:\/\/people.math.gatech.edu\/~tetali\/PUBLIS\/BGKNT_final.pdf","DOI":"10.1145\/1250790.1250809"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0021-9800(70)80019-9","volume":"9","author":"L.W. Beineke","year":"1970","unstructured":"Beineke, L.W.: Characterizations of derived graphs. J. Combin. Theory\u00a09, 129\u2013135 (1970)","journal-title":"J. Combin. Theory"},{"issue":"3","key":"33_CR4","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/j.jctb.2006.06.001","volume":"97","author":"M. Chudnovsky","year":"2007","unstructured":"Chudnovsky, M., Seymour, P.: The roots of the independence polynomial of a clawfree graph. J. Combin. Theory Ser. B\u00a097(3), 350\u2013357 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1137\/1115049","volume":"15","author":"R. Dobrushin","year":"1970","unstructured":"Dobrushin, R.: Prescribing a system of random variables by conditional distributions. Theor. Probab. Appl.\u00a015, 458\u2013486 (1970)","journal-title":"Theor. Probab. Appl."},{"issue":"5","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/S0097539701383844","volume":"31","author":"M. Dyer","year":"2002","unstructured":"Dyer, M., Frieze, A., Jerrum, M.: On counting independent sets in sparse graphs. SIAM J. Comput.\u00a031(5), 1527\u20131541 (2002)","journal-title":"SIAM J. Comput."},{"key":"33_CR7","unstructured":"Fadnavis, S.: Approximating independence polynomials of claw-free graphs (2012), \n                  \n                    http:\/\/www.math.harvard.edu\/~sukhada\/IndependencePolynomial.pdf"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/PL00001601","volume":"9","author":"C. Greenhill","year":"2000","unstructured":"Greenhill, C.: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Comput. Complexity\u00a09(1), 52\u201372 (2000)","journal-title":"Comput. Complexity"},{"issue":"3","key":"33_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02770519","volume":"3","author":"O. Heilmann","year":"1972","unstructured":"Heilmann, O.: Existence of phase transitions in certain lattice gases with repulsive potential. Lett. Al Nuovo Cimento Series 2\u00a03(3), 95\u201398 (1972)","journal-title":"Lett. Al Nuovo Cimento Series 2"},{"issue":"6","key":"33_CR10","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM J. Comput.\u00a018(6), 1149\u20131178 (1989)","journal-title":"SIAM J. Comput."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Karpi\u0144ski, M., Ruci\u0144ski, A., Szyma\u0144ska, E.: Approximate counting of matchings in sparse uniform hypergraphs. In: 2013 Proceedings of the Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 72\u201379. SIAM (2013)","DOI":"10.1137\/1.9781611973037.9"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Kelly, F.P.: Stochastic models of computer communication systems. J. Roy. Statist. Soc. Ser. B\u00a047(3), 379\u2013395, 415\u2013428 (1985)","DOI":"10.1111\/j.2517-6161.1985.tb01367.x"},{"issue":"3-4","key":"33_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<229::AID-RSA3>3.0.CO;2-X","volume":"15","author":"M. Luby","year":"1999","unstructured":"Luby, M., Vigoda, E.: Fast convergence of the Glauber dynamics for sampling independent sets. Random Structures Algorithms\u00a015(3-4), 229\u2013241 (1999)","journal-title":"Random Structures Algorithms"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Sly, A.: Computational transition at the uniqueness threshold. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science FOCS 2010, pp. 287\u2013296 (2010)","DOI":"10.1109\/FOCS.2010.34"},{"key":"33_CR15","unstructured":"Sly, A., Sun, N.: The computational hardness of counting in two-spin models on d-regular graphs. In: FOCS, pp. 361\u2013369 (2012), \n                  \n                    http:\/\/arxiv.org\/abs\/1203.2602"},{"issue":"3","key":"33_CR16","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput.\u00a08(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Weitz, D.: Counting independent sets up to the tree threshold. In: STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 140\u2013149. ACM (2006)","DOI":"10.1145\/1132516.1132538"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08404-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T04:13:26Z","timestamp":1558930406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08404-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084039","9783319084046"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08404-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}