Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem (Q3608477): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-74593-8_12 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1682147331 / rank | |||
Normal rank | |||
Latest revision as of 01:17, 20 March 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
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
