Mathematical characterizations and computational complexity of anti-slide puzzles (Q5918568): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.026 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4308483689 / 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: Q4313096 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Any monotone function is realized by interlocked polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5452284 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3651735 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / 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: Q5427478 / rank | |||
Normal rank |
Latest revision as of 21:37, 30 July 2024
scientific article; zbMATH DE number 7619405
Language | Label | Description | Also known as |
---|---|---|---|
English | Mathematical characterizations and computational complexity of anti-slide puzzles |
scientific article; zbMATH DE number 7619405 |
Statements
Mathematical characterizations and computational complexity of anti-slide puzzles (English)
0 references
17 November 2022
0 references
anti-slide puzzle
0 references
interlock puzzle
0 references
strong NP-completeness
0 references
convexity
0 references