"The Computational Complexity of Knot and Link Problems."

Joel Hass, J. C. Lagarias, Nicholas Pippenger (1999)

> Home

Details and statistics

DOI: 10.1145/301970.301971

access: closed

type: Journal Article

metadata version: 2021-03-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/HassLP99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/HassLP99
Joel Hass, J. C. Lagarias, Nicholas Pippenger:
The Computational Complexity of Knot and Link Problems. J. ACM 46(2): 185-211 (1999)

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.