On the complexity of jelly-no-puzzle

DOI10.1007/978-3-030-90048-9_13OpenAlexW3210970463MaRDI QIDQ2695482FDOQ2695482

Authors: Yanyan Li 

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90048-9_13

zbMATH Keywords

computational complexitymotion planningcombinatorial puzzles\textsf{NP}-complete

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of game theory (91A80) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Reducibility among combinatorial problems
• Assembling molecules in ATOMIX is hard
• Title not available (Why is that?)
• TETRIS IS HARD, EVEN TO APPROXIMATE
• \textsc{Hanano} puzzle is \textsf{NP}-hard

Cited In (2)

• Defying gravity and gadget numerosity: the complexity of the Hanano puzzle
• Defying gravity and gadget numerosity: the complexity of the Hanano puzzle and beyond

This page was built for publication: On the complexity of jelly-no-puzzle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695482)