|
|
|
|
| LEADER |
01311 am a22002533u 4500 |
| 001 |
86210 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Demaine, Erik D.
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Demaine, Erik D.
|e contributor
|
| 100 |
1 |
0 |
|a Demaine, Martin L.
|e contributor
|
| 100 |
1 |
0 |
|a Eisenstat, Sarah Charmian
|e contributor
|
| 700 |
1 |
0 |
|a Demaine, Martin L.
|e author
|
| 700 |
1 |
0 |
|a Morgan, Thomas D.
|e author
|
| 700 |
1 |
0 |
|a Uehara, Ryuhei
|e author
|
| 700 |
1 |
0 |
|a Eisenstat, Sarah Charmian
|e author
|
| 245 |
0 |
0 |
|a Variations on Instant Insanity
|
| 260 |
|
|
|b Springer-Verlag,
|c 2014-04-17T19:29:58Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/86210
|
| 520 |
|
|
|a In one of the first papers about the complexity of puzzles, Robertson and Munro [14] proved that a generalized form of the then-popular Instant Insanity puzzle is NP-complete. Here we study several variations of this puzzle, exploring how the complexity depends on the piece shapes and the allowable orientations of those shapes.
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Space-Efficient Data Structures, Streams, and Algorithms
|
