Tetravex is NP-complete (Q845713)

From MaRDI portal
Revision as of 21:55, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/ipl/TakenagaW06, #quickstatements; #temporary_batch_1731530891435)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Tetravex is NP-complete
scientific article

    Statements

    title
    Tetravex is NP-complete (English)
    0 references
    author
    Yasuhiko Takenaga
    0 references
    Toby Walsh
    0 references
    publication date
    29 January 2010
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    NP-completeness
    0 references
    tetravex
    0 references

    Identifiers

    zbMATH DE Number
    5664479
    0 references
    Wikidata QID
    Q57481109
    0 references
    OpenAlex ID
    W2136889863
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q845713&oldid=37909669"
    Powered by MediaWiki