TY - JOUR

T1 - The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes

AU - Liśkiewicz, Maciej

AU - Ogihara, Mitsunori

AU - Toda, Seinosuke

N1 - Funding Information:
∗Corresponding author. E-mail addresses: liskiewi@tcs.mu-luebeck.de (M. Lis,kiewicz), ogihara@cs.rochester.edu (M. Ogihara), toda@am.chs.nihon-u.ac.jp (S. Toda). 1On leave from Instytut Informatyki, Uniwersytet Wroc lawski, Poland. 2Supported in part by NSF grants EIA-0080124, EIA-0205061, and DUE-9980943 and by NIH grants RO1-AG18231 and P30-AG18254.

PY - 2003/7/28

Y1 - 2003/7/28

N2 - Valiant (SIAM J. Comput. 8 (1979) 410-421) showed that the problem of computing the number of simple s-t paths in graphs is #P-complete both in the case of directed graphs and in the case of undirected graphs. Welsh (Complexity: Knots, Colourings and Counting, Cambridge University Press, Cambridge, 1993, p. 17) asked whether the problem of computing the number of self-avoiding walks of a given length in the complete two-dimensional grid is complete for #P1, the tally-version of #P. This paper offers a partial answer to the question of Welsh: it is #P-complete to compute the number of self-avoiding walks of a given length in a subgraph of a two-dimensional grid. Several variations of the problem are also studied and shown to be #P-complete. This paper also studies the problem of computing the number of self-avoiding walks in a subgraph of a hypercube. Similar completeness results are shown for the problem. By scaling the computation time to exponential, it is shown that computing the number of self-avoiding walks in hypercubes is a complete problem for #EXP in the case when a subgraph of a hypercube is specified by its dimension and a boolean circuit that accepts the nodes. Finally, this paper studies the complexity of testing whether a given word over the four-letter alphabet {U,D,L,R} represents a self-avoiding walk in a two-dimensional grid. A linear-space lower bound is shown for nondeterministic Turing machines with a 1-way input head to make this test.

AB - Valiant (SIAM J. Comput. 8 (1979) 410-421) showed that the problem of computing the number of simple s-t paths in graphs is #P-complete both in the case of directed graphs and in the case of undirected graphs. Welsh (Complexity: Knots, Colourings and Counting, Cambridge University Press, Cambridge, 1993, p. 17) asked whether the problem of computing the number of self-avoiding walks of a given length in the complete two-dimensional grid is complete for #P1, the tally-version of #P. This paper offers a partial answer to the question of Welsh: it is #P-complete to compute the number of self-avoiding walks of a given length in a subgraph of a two-dimensional grid. Several variations of the problem are also studied and shown to be #P-complete. This paper also studies the problem of computing the number of self-avoiding walks in a subgraph of a hypercube. Similar completeness results are shown for the problem. By scaling the computation time to exponential, it is shown that computing the number of self-avoiding walks in hypercubes is a complete problem for #EXP in the case when a subgraph of a hypercube is specified by its dimension and a boolean circuit that accepts the nodes. Finally, this paper studies the complexity of testing whether a given word over the four-letter alphabet {U,D,L,R} represents a self-avoiding walk in a two-dimensional grid. A linear-space lower bound is shown for nondeterministic Turing machines with a 1-way input head to make this test.

UR - http://www.scopus.com/inward/record.url?scp=0037811208&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037811208&partnerID=8YFLogxK

U2 - 10.1016/S0304-3975(03)00080-X

DO - 10.1016/S0304-3975(03)00080-X

M3 - Article

AN - SCOPUS:0037811208

VL - 304

SP - 129

EP - 156

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-3

ER -