Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem (Q3608477)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem |
scientific article; zbMATH DE number 5523464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem |
scientific article; zbMATH DE number 5523464 |
Statements
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem (English)
0 references
5 March 2009
0 references
computational complexity
0 references
rotation puzzle
0 references
tiling of the plane
0 references
parsimonious reduction
0 references
counting problem
0 references
0.9999663829803468
0 references
0.9157457947731018
0 references
0.9126293659210204
0 references
0.8761329054832458
0 references
0.7433235049247742
0 references
