"The Complexity of Computing the Number of Self-Avoiding Walks in ..."

Mitsunori Ogihara, Seinosuke Toda (2001)

> Home

Details and statistics

DOI: 10.1007/3-540-44683-4_51

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/OgiharaT01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/OgiharaT01
Mitsunori Ogihara, Seinosuke Toda:
The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. MFCS 2001: 585-597

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.