The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.

Mitsunori Ogihara, Seinosuke Toda

Browse the full MFCS paper archive.