{"created":"2025-01-19T01:41:48.975277+00:00","updated":"2025-01-19T08:32:19.239826+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00238530","sets":["1164:2592:11452:11708"]},"path":["11708"],"owner":"44499","recid":"238530","title":["FCPハミルトン閉路問題の計算困難性"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-08-29"},"_buckets":{"deposit":"6a7d588e-7568-4498-86c0-136d2937e187"},"_deposit":{"id":"238530","pid":{"type":"depid","value":"238530","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"FCPハミルトン閉路問題の計算困難性","author_link":["653191","653193","653192","653190"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"FCPハミルトン閉路問題の計算困難性"},{"subitem_title":"Computational Complexity on FCP-Hamiltonian Cycle Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2024-08-29","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":"Ochanomizu University","subitem_text_language":"en"},{"subitem_text_value":"Ochanomizu University","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/238530/files/IPSJ-AL24199003.pdf","label":"IPSJ-AL24199003.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL24199003.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"c4432dcf-fa1a-4703-a940-44b8877a96b0","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"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":"Karin, Umebayashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Atsuki, Nagao","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":"一般的な判定問題に対し，その解が含む情報を固定することで解を唯一にすることができるかを問う Fewest Clues Problem という枠組みがある．NP 完全問題の FCP バージョンは Σ2P という計算クラスに属すことが知られ，またいくつかの NP 完全問題の FCP バージョンが Σ2P 完全であることが知られている．本研究ではハミルトン閉路問題の FCP バージョンについての計算複雑性を解析し，FCP 1-in-3 SAT からの特殊な多項式時間帰着を用いることで Σ2P 完全であることを示した．またこの結果は入力グラフを二部平面グラフや 3-正則グラフ，split グラフ等に制限しても同様であることを示した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In the framework known as the Fewest Clues Problem (FCP), the task is to determine whether the solution to a decision problem can be made having unique solution by fixing certain pieces of information. It is known that the FCP versions of NP-complete problems belong to the complexity class Σ2P, and some FCP versions of NP-complete problems are known to be Σ2P-complete. In this study, we analyze the computational complexity of the FCP version of the Hamiltonian Cycle Problem. And we show that it is Σ2P-complete by utilizing a special polynomial-time reduction from the FCP 1-in-3 SAT problem. Furthermore, we show that this result holds even when the input graph is restricted to bipartite graphs, 3-regular graphs, or split graphs.","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":"2024-08-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2024-AL-199"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":238530,"links":{}}