{"links":{},"id":2001550,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:02001550","sets":["934:989:1739363130374:1740480202459"]},"path":["1740480202459"],"owner":"80578","recid":"2001550","title":["サムラインのNP完全性の証明と量子アニーリングを用いた解法について"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2025-03-11"},"_buckets":{"deposit":"1adb2ef5-b78f-4131-94bc-f5d89b4db19a"},"_deposit":{"id":"2001550","pid":{"type":"depid","value":"2001550","revision_id":0},"owners":[80578],"status":"published","created_by":80578},"item_title":"サムラインのNP完全性の証明と量子アニーリングを用いた解法について","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"サムラインのNP完全性の証明と量子アニーリングを用いた解法について","subitem_title_language":"ja"},{"subitem_title":"Proof of NP-completeness of Sumline and Solution Using Quantum Annealing","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[オリジナル論文] 量子アニーリング，計算困難性，NP完全，組合せパズルゲーム，サムライン","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2025-03-11","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"静岡県立大学大学院経営情報イノベーション研究科"},{"subitem_text_value":"静岡県立大学大学院経営情報イノベーション研究科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Management, Informatics and Innovation, University of Shizuoka","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Management, Informatics and Innovation, University of Shizuoka","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/2001550/files/IPSJ-TOM1802002.pdf","label":"IPSJ-TOM1802002.pdf"},"date":[{"dateType":"Available","dateValue":"2027-03-11"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM1802002.pdf","filesize":[{"value":"605.3 KB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"3a60fc8e-a800-4ca4-aafc-90d8013070e8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2025 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"福永,智渉"}]},{"creatorNames":[{"creatorName":"大久保,誠也"}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Chiho Fukunaga","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Seiya Okubo","creatorNameLang":"en"}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7780","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本研究では，組合せパズルゲームの1つである，サムラインがNP完全であることを証明する．証明では，NP完全問題であるカックロからの多項式時間帰着を用いてNP完全性を示す．さらに量子アニーリングを用いた解法を提案する．具体的には，サムラインを2次式と1次式の項からなるハミルトニアンに変換する手法を提案する．また，計算機実験を行うことで，手法の妥当性を示す．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this study, we prove that one of the combinatorial puzzle games, Sumline, is NP-complete. The proof is based on a polynomial-time reduction from KAKURO, which is an NP-complete problem, to show NP-completeness. Furthermore, we propose a method to solve the Sumline using Quantum annealing. Specifically, we propose a method to transform the Sumline into a Hamiltonian consisting of quadratic and linear terms. In addition, computer experiments are conducted to demonstrate the validity of the method.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"12","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2025-03-11","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"18"}]},"relation_version_is_last":true,"weko_creator_id":"80578"},"created":"2025-03-05T02:14:31.889301+00:00","updated":"2025-03-05T02:14:39.393432+00:00"}