Variations on instant insanity

DOI10.1007/978-3-642-40273-9_4MaRDI QIDQ2848966zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara

Publication date 13 September 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/86210

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
• Curing Instant Insanity II
• NP-completeness of two pencil puzzles: Yajilin and Country Road
• scientific article; zbMATH DE number 1933247
• TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable

Cites work

• A course in combinatorics.
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An analysis of the (colored cubes)\(^{3}\) puzzle
• Games, puzzles, and computation
• scientific article; zbMATH DE number 3596617 (Why is no real title available?)
• scientific article; zbMATH DE number 1933247 (Why is no real title available?)
• On Representatives of Subsets
• On the Complexity of Timetable and Multicommodity Flow Problems
• The complexity of satisfiability problems

Cited in

(5)

• scientific article; zbMATH DE number 1933247 (Why is no real title available?)
• Curing Instant Insanity II
• The 4-color cubes puzzle
• The corner poset with an application to an n-dimensional hypercube stacking puzzle
• On a generalization of ``eight blocks to madness puzzle

This page was built for publication: Variations on instant insanity

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