Unlinking, splitting, and some other NP-hard problems in knot theory
- Award ID(s):
- 2005496
- PAR ID:
- 10646426
- Publisher / Repository:
- Society for Industrial and Applied Mathematics
- Date Published:
- Page Range / eLocation ID:
- 1496 to 1507
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

