Computational Complexity of String Puzzles

Chuzo Iwamoto, Kento Sasaki, Kenichi Morita. Computational Complexity of String Puzzles. In Julián Mestre, editor, Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012. Volume 128 of CRPIT, pages 69-74, Australian Computer Society, 2012. [doi]

@inproceedings{IwamotoSM12,
  title = {Computational Complexity of String Puzzles},
  author = {Chuzo Iwamoto and Kento Sasaki and Kenichi Morita},
  year = {2012},
  url = {http://crpit.com/abstracts/CRPITV128Iwamoto.html},
  researchr = {https://researchr.org/publication/IwamotoSM12},
  cites = {0},
  citedby = {0},
  pages = {69-74},
  booktitle = {Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012},
  editor = {Julián Mestre},
  volume = {128},
  series = {CRPIT},
  publisher = {Australian Computer Society},
  isbn = {978-1-921770-09-8},
}