{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T13:59:25Z","timestamp":1775483965438,"version":"3.50.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3669,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0304-3975(03)00080-x","type":"journal-article","created":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T01:16:11Z","timestamp":1048641371000},"page":"129-156","source":"Crossref","is-referenced-by-count":24,"title":["The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes"],"prefix":"10.1016","volume":"304","author":[{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsunori","family":"Ogihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seinosuke","family":"Toda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00080-X_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ita\/1996300100011","article-title":"Relationships among PL, #L, and the determinant","volume":"30","author":"Allender","year":"1996","journal-title":"RAIRO\u2014Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(03)00080-X_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","article-title":"A very hard Log-space counting classes","volume":"107","author":"\u00c1lvarez","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(03)00080-X_BIB3","doi-asserted-by":"crossref","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","article-title":"On the computational complexity of Ising spin glass models","volume":"15","author":"Barahona","year":"1982","journal-title":"J. Phys. A"},{"issue":"4","key":"10.1016\/S0304-3975(03)00080-X_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","article-title":"A linear time algorithm for drawing a planar graph on a grid","volume":"54","author":"Chrobak","year":"1995","journal-title":"Inform. Process. Lett."},{"issue":"26","key":"10.1016\/S0304-3975(03)00080-X_BIB5","doi-asserted-by":"crossref","first-page":"5284","DOI":"10.1103\/PhysRevLett.77.5284","article-title":"Square lattice self-avoiding walks and corrections-to-scaling","volume":"77","author":"Conway","year":"1996","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"10.1016\/S0304-3975(03)00080-X_BIB6","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","article-title":"The planar Hamiltonian circuit problem is NP-complete","volume":"5","author":"Garey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00080-X_BIB7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1006\/inco.1999.2810","article-title":"Tally NP sets and easy census functions","volume":"158","author":"Goldsmith","year":"2000","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(03)00080-X_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1111\/j.2517-6161.1954.tb00145.x","article-title":"Poor man's Monte Carlo","volume":"16","author":"Hammersley","year":"1954","journal-title":"J. Roy. Statist. Soc. B"},{"issue":"2","key":"10.1016\/S0304-3975(03)00080-X_BIB9","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1093\/qmath\/13.1.108","article-title":"Further results on the rate of convergence to the connective constant of the hypercubical lattice","volume":"13","author":"Hammersley","year":"1962","journal-title":"Quart. J. Math. Oxford"},{"issue":"4","key":"10.1016\/S0304-3975(03)00080-X_BIB10","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1137\/S0097539793304601","article-title":"The complexity of planar counting problems","volume":"27","author":"Hunt III","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00080-X_BIB11","doi-asserted-by":"crossref","unstructured":"S. Istrail, Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intractability for the partition function of the Ising model across non-planar surfaces, in: Proc. 31st Symp. on Theory of Computing, ACM Press, New York, 2000, pp. 87\u201396.","DOI":"10.1145\/335305.335316"},{"key":"10.1016\/S0304-3975(03)00080-X_BIB12","doi-asserted-by":"crossref","unstructured":"R.M. Karp, R.J. Lipton, Some connections between nonuniform and uniform complexity classes, in: Proc. 12th Symp. on Theory of Computing, ACM Press, New York, 1980. pp. 302\u2013309.","DOI":"10.1145\/800141.804678"},{"key":"10.1016\/S0304-3975(03)00080-X_BIB13","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0196-6774(91)90004-I","article-title":"The complexity of congestion-1 embedding in a hypercube","volume":"12","author":"Kim","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(03)00080-X_BIB14","series-title":"The Self-Avoiding Walk","author":"Madras","year":"1993"},{"key":"10.1016\/S0304-3975(03)00080-X_BIB15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/(SICI)1097-0037(199901)33:1<71::AID-NET5>3.0.CO;2-3","article-title":"Small congestion embedding of graphs into hypercubes","volume":"33","author":"Matsubayashi","year":"1999","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(03)00080-X_BIB16","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"issue":"3","key":"10.1016\/S0304-3975(03)00080-X_BIB17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0019-9958(86)80009-2","article-title":"A note on succinct representations of graphs","volume":"71","author":"Papadimitriou","year":"1986","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(03)00080-X_BIB18","doi-asserted-by":"crossref","unstructured":"A. P\u00f6nitz, P. Tittman, Improved upper bounds for self-avoiding walks in Zd, Electron. J. Combinatorics 7 (1) (2000) #R21. http:\/\/www.combinatorics.org\/Volume_7\/v7i1toc.html.","DOI":"10.37236\/1499"},{"issue":"3","key":"10.1016\/S0304-3975(03)00080-X_BIB19","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1137\/0215050","article-title":"The complexity of reliability computations in planar and acyclic graphs","volume":"15","author":"Provan","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(03)00080-X_BIB20","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1063\/1.533197","article-title":"Self-testing algorithms for self-avoiding walks","volume":"41","author":"Randall","year":"2000","journal-title":"J. Math. Phys."},{"key":"10.1016\/S0304-3975(03)00080-X_BIB21","series-title":"Proc. 10th Symp. on Theory of Computing","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/S0304-3975(03)00080-X_BIB22","series-title":"The Encyclopedia of Integer Sequences","author":"Sloane","year":"1995"},{"issue":"5","key":"10.1016\/S0304-3975(03)00080-X_BIB23","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0220053","article-title":"PP is as hard as the polynomial time hierarchy","volume":"20","author":"Toda","year":"1991","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(03)00080-X_BIB24","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/S0097539797321602","article-title":"The complexity of counting in sparse, regular, and planar graphs","volume":"31","author":"Vadhan","year":"2001","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(03)00080-X_BIB25","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(03)00080-X_BIB26","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00080-X_BIB27","series-title":"Complexity: Knots, Colourings and Counting","author":"Welsh","year":"1993"},{"issue":"1","key":"10.1016\/S0304-3975(03)00080-X_BIB28","doi-asserted-by":"crossref","DOI":"10.37236\/1255","article-title":"Enumerating up-side self-avoiding walks on integer lattices","volume":"3","author":"Williams","year":"1996","journal-title":"Electron. J. Combinatorics"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750300080X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750300080X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:04:08Z","timestamp":1733954648000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750300080X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S030439750300080X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00080-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}