Variations on Instant Insanity

DOI10.1007/978-3-642-40273-9_4zbMath1395.68148OpenAlexW1514296775MaRDI QIDQ2848966

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

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)

Related Items (3)

Unnamed Item ⋮ On a generalization of ``eight blocks to madness puzzle ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• An analysis of the (colored cubes)\(^{3}\) puzzle
• On the Complexity of Timetable and Multicommodity Flow Problems
• On Representatives of Subsets
• The complexity of satisfiability problems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Variations on Instant Insanity