{"created":"2025-01-19T01:28:04.618306+00:00","updated":"2025-01-19T11:39:46.822190+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00228946","sets":["1164:2592:11085:11360"]},"path":["11360"],"owner":"44499","recid":"228946","title":["一般化マッチングマッチの困難性の研究"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-11-09"},"_buckets":{"deposit":"d8e62c1b-3dd2-426d-9f2b-73c7fb39da3c"},"_deposit":{"id":"228946","pid":{"type":"depid","value":"228946","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"一般化マッチングマッチの困難性の研究","author_link":["614880","614881","614882","614883"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"一般化マッチングマッチの困難性の研究"},{"subitem_title":"Computational Complexity of Generalized Matching-Match Puzzle","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2023-11-09","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北陸先端科学技術大学院大学情報科学系"},{"subitem_text_value":"北陸先端科学技術大学院大学情報科学系"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"School of Information Science, Japan Advanced Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"School of Information Science, Japan Advanced Institute of Science and Technology","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/228946/files/IPSJ-AL23195026.pdf","label":"IPSJ-AL23195026.pdf"},"date":[{"dateType":"Available","dateValue":"2025-11-09"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL23195026.pdf","filesize":[{"value":"2.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"7839e789-af2d-472f-8cc3-f778a87aa1aa","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"飯降, 雄樹"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"上原, 隆平"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuki, Iburi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ryuhei, Uehara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"マッチングマッチの計算量的な困難さを研究する．マッチングマッチは株式会社大創出版より発表されたパズルである．様々なパズルの困難さの研究が行われているが，マッチングマッチはそのどのパズルとも異なる問題設定となっている．本稿ではまず，一般化マッチングマッチを定式化する．次に，定式化したマッチングマッチがNP完全であることを示す．一方，問題の入力に制限を与えると多項式時間で解けることを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We study the computational complexity of Matching-Match. Matching-Match, which is a puzzle introduced by Daiso Publishing. Research has been conducted on the computational complexity of various puzzles, but Matching-Match's problem setting is different from any of them. In this paper, we formulate a generalized Matching-Match. Then, we show the generalized Matching-Match is NP-complete. On the other hand, we show that if we limit the input of the problem, it can be solved in polynomial time.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-11-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"26","bibliographicVolumeNumber":"2023-AL-195"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":228946,"links":{}}