skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Award ID contains: 2005496

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Illinois Journal of Mathematics)
    null (Ed.)
    Full Text Available 
  2. ; (, Transactions of the American Mathematical Society, Series B)
    null (Ed.)
    We prove that certain problems naturally arising in knot theory are NP–hard or NP–complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link has an unlinking or splitting number k k , finding a k k -component unlink as a sublink, and finding a k k -component alternating sublink. 
    more » « less
    Full Text Available 
  3. (, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)))
    null (Ed.)
    Accepted Manuscript Full Text Available