Mathematical characterizations and computational complexity of anti-slide puzzles (Q5919108): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3651735 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5452284 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5427478 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetric assembly puzzles are hard, beyond a few pieces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering convex sets with non-overlapping polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4313096 / rank | |||
Normal rank |
Latest revision as of 19:11, 26 July 2024
scientific article; zbMATH DE number 7405972
Language | Label | Description | Also known as |
---|---|---|---|
English | Mathematical characterizations and computational complexity of anti-slide puzzles |
scientific article; zbMATH DE number 7405972 |
Statements
Mathematical characterizations and computational complexity of anti-slide puzzles (English)
0 references
4 October 2021
0 references
anti-slide puzzle
0 references
interlock puzzle
0 references
strong NP-completeness
0 references
convexity
0 references