{"created":"2025-01-19T01:27:59.607303+00:00","updated":"2025-01-19T11:41:34.243334+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00228859","sets":["934:989:11239:11352"]},"path":["11352"],"owner":"44499","recid":"228859","title":["キンコンカンのNP完全性の証明について"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-10-31"},"_buckets":{"deposit":"e83a0608-9f5c-404b-9e51-a496d3e03b8d"},"_deposit":{"id":"228859","pid":{"type":"depid","value":"228859","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"キンコンカンのNP完全性の証明について","author_link":["614356","614357","614359","614358"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"キンコンカンのNP完全性の証明について"},{"subitem_title":"Proof of NP-completeness of Kin-Kon-Kan","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[オリジナル論文] 計算困難性，NP完全，組合せパズルゲーム，キンコンカン","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2023-10-31","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 and Information of Innovation, University of Shizuoka","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Management and Information of 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/228859/files/IPSJ-TOM1602007.pdf","label":"IPSJ-TOM1602007.pdf"},"date":[{"dateType":"Available","dateValue":"2025-10-31"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM1602007.pdf","filesize":[{"value":"632.9 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":"f7db38ed-2f2c-452d-9780-477fd3bfcfa6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"福永, 智渉"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"大久保, 誠也"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Chiho, Fukunaga","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Seiya, Okubo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"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完全問題であるCircuit SATからの多項式時間帰着を用いて，証明を行う．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this study, we prove that the existence determination of a solution is an NP-complete problem for one of the combinatorial puzzles, Kin-Kon-Kan. Specifically, the proof is based on a polynomial-time reduction from Circuit SAT, which is an NP-complete problem.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"66","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"59","bibliographicIssueDates":{"bibliographicIssueDate":"2023-10-31","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"16"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":228859,"links":{}}