Unshuffling a square is NP-hard (Q2637646)

From MaRDI portal
Revision as of 07:35, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Unshuffling a square is NP-hard
scientific article

    Statements

    title
    Unshuffling a square is NP-hard (English)
    0 references
    author
    Samuel R. Buss
    0 references
    Michael Soltys
    0 references
    publication date
    13 February 2014
    0 references
    zbMATH Keywords
    square shuffle
    0 references
    NP-completeness
    0 references

    Identifiers

    zbMATH DE Number
    6257466
    0 references
    OpenAlex ID
    W2163733217
    0 references
    arXiv ID
    1211.7161
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2637646&oldid=33540992"
    Powered by MediaWiki