Satogaeri, Hebi, and Suraromu Are NP-Complete

Shohei Kanehiro, Yasuhiko Takenaga. Satogaeri, Hebi, and Suraromu Are NP-Complete. In 3rd International Conference on Applied Computing and Information Technology, ACIT 2015/2nd International Conference on Computational Science and Intelligence, CSI 2015, Okayama, Japan, July 12-16, 2015. pages 46-51, IEEE, 2015. [doi]

Abstract

Abstract is missing.