The computational complexity of knot and link problems (Q3158535)

From MaRDI portal
Revision as of 14:26, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The computational complexity of knot and link problems
scientific article

    Statements

    title
    The computational complexity of knot and link problems (English)
    0 references
    author
    Joel Hass
    0 references
    Jeffrey C. Lagarias
    0 references
    Nicholas J. Pippenger
    0 references
    publication date
    25 January 2005
    0 references

    Identifiers

    DOI
    10.1145/301970.301971
    0 references
    zbMATH DE Number
    2131027
    0 references
    Wikidata QID
    Q29011807
    0 references
    OpenAlex ID
    W2068497209
    0 references
    arXiv ID
    math/9807016
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3158535&oldid=33604110"
    Powered by MediaWiki