Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem (Q3608477): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:09, 5 February 2024

scientific article
Language Label Description Also known as
English
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem
scientific article

    Statements

    Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem (English)
    0 references
    0 references
    0 references
    5 March 2009
    0 references
    0 references
    computational complexity
    0 references
    rotation puzzle
    0 references
    tiling of the plane
    0 references
    parsimonious reduction
    0 references
    counting problem
    0 references