{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00241900","sets":["1164:2592:11887:11888"]},"path":["11888"],"owner":"44499","recid":"241900","title":["Exact Algorithm for the Boolean Connectivity of <i>k</i>-Horn Formulas via Deterministic PPZ"],"pubdate":{"attribute_name":"公開日","attribute_value":"2025-01-07"},"_buckets":{"deposit":"dd7c5155-e77a-436e-890f-9887bba2184c"},"_deposit":{"id":"241900","pid":{"type":"depid","value":"241900","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Exact Algorithm for the Boolean Connectivity of <i>k</i>-Horn Formulas via Deterministic PPZ","author_link":["666787","666781","666786","666785","666784","666782","666783","666788"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Exact Algorithm for the Boolean Connectivity of <i>k</i>-Horn Formulas via Deterministic PPZ"},{"subitem_title":"Exact Algorithm for the Boolean Connectivity of <i>k</i>-Horn Formulas via Deterministic PPZ","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2025-01-07","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Hokkaido University"},{"subitem_text_value":"University of Hyogo"},{"subitem_text_value":"Hokkaido University"},{"subitem_text_value":"Hokkaido University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"University of Hyogo","subitem_text_language":"en"},{"subitem_text_value":"Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Hokkaido University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/241900/files/IPSJ-AL25201012.pdf","label":"IPSJ-AL25201012.pdf"},"date":[{"dateType":"Available","dateValue":"2027-01-07"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL25201012.pdf","filesize":[{"value":"1.0 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":"a0496be3-5bde-4d66-af44-30c0487ad8e5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2025 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuto, Okura"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Junichi, Teruyama"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuhisa, Seto"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takashi, Horiyama"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuto, Okura","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Junichi, Teruyama","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuhisa, Seto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takashi, Horiyama","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":"The Boolean connectivity problem asks whether the satisfying assignments of a given Boolean formula are connected over the n-dimensional hypercube. Makino, Yamamoto, and Tamaki showed that this problem is coNP-complete even if a given formula is restricted to a 3-Horn formula. In this paper, we show that the deterministic PPZ algorithm presented by Paturi, Pudlak, and Zane can solve the Boolean Connectivity of a given k-Horn formula over n variables in time O*(2(1-1/2k)n). It can also count the number of the connected components of satisfying assignments.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The Boolean connectivity problem asks whether the satisfying assignments of a given Boolean formula are connected over the n-dimensional hypercube. Makino, Yamamoto, and Tamaki showed that this problem is coNP-complete even if a given formula is restricted to a 3-Horn formula. In this paper, we show that the deterministic PPZ algorithm presented by Paturi, Pudlak, and Zane can solve the Boolean Connectivity of a given k-Horn formula over n variables in time O*(2(1-1/2k)n). It can also count the number of the connected components of satisfying assignments.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2025-01-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12","bibliographicVolumeNumber":"2025-AL-201"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":241900,"updated":"2025-01-19T07:30:12.238735+00:00","links":{},"created":"2025-01-19T01:46:47.146674+00:00"}