On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584)

From MaRDI portal
Revision as of 01:13, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the hardness of solving edge matching puzzles as SAT or CSP problems
scientific article

    Statements

    title
    On the hardness of solving edge matching puzzles as SAT or CSP problems (English)
    0 references
    author
    Carlos Ansótegui
    0 references
    Ramón Béjar
    0 references
    Cèsar Fernández
    0 references
    Carles Mateu
    0 references
    published in
    Constraints
    0 references
    publication date
    29 April 2015
    0 references
    Mathematics Subject Classification ID
    05B40
    0 references
    05B50
    0 references
    52C20
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6431887
    0 references
    zbMATH Keywords
    constraints
    0 references
    SAT
    0 references
    CSP
    0 references
    edge matching puzzles
    0 references
    puzzles
    0 references
    phase transition
    0 references
    hardness
    0 references
    Wikidata QID
    Q62043254
    0 references
    describes a project that uses
    MiniSat
    0 references
    MINION
    0 references
    OpenAlex ID
    W2046346504
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2342584&oldid=35452142"
    Powered by MediaWiki