{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00102915","sets":["1164:2592:7425:7658"]},"path":["7658"],"owner":"11","recid":"102915","title":["<i>k</i>-IBDD充足可能性問題に対する厳密アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-09-05"},"_buckets":{"deposit":"2708fd70-7897-493c-a88f-91029a3c9bd3"},"_deposit":{"id":"102915","pid":{"type":"depid","value":"102915","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"<i>k</i>-IBDD充足可能性問題に対する厳密アルゴリズム","author_link":["0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"<i>k</i>-IBDD充足可能性問題に対する厳密アルゴリズム"}]},"item_type_id":"4","publish_date":"2014-09-05","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"成蹊大学"},{"subitem_text_value":"国立情報学研究所／JST, ERATO, 河原林巨大グラフプロジェクト"},{"subitem_text_value":"京都大学／日本学術振興会特別研究員DC"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Seikei University","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Informatics / JST, ERATO, Kawarabayashi Large Graph Project","subitem_text_language":"en"},{"subitem_text_value":"Kyoto University / Research Fellow of Japan Society for the Promotion of Science","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/102915/files/IPSJ-AL14149009.pdf"},"date":[{"dateType":"Available","dateValue":"2016-09-05"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL14149009.pdf","filesize":[{"value":"874.2 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"4dfc3bfc-a733-4db8-a259-0a2c77cd7c36","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"脊戸和寿"},{"creatorName":"照山順一"},{"creatorName":"長尾篤樹"}],"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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"k-IBDD は，k 段のレイヤーを持つ分岐プログラムであり，各レイヤーが OBDD (順序付き二分決定図) となっている．本稿では，k-IBDD 充足可能性問題 （以下，k-IBDD SAT） を考える．k-IBDD SAT とは，入力として k-IBDD が与えられ，シンク 1 に到達する変数への割当が存在するかどうかを判定する問題である．本稿では，n 変数，poly(n) ノードの 2-IBDD SAT を高々 poly(n)・2n-√n 時間で解く多項式領域アルゴリズムを与える．poly(n) は n の多項式を表す．さらに，このアルゴリズムを拡張することにより，n 変数，poly(n) ノードの k-IBDD SAT を高々，poly(n)・2n-n1/2k-1 時間で解く多項式領域アルゴリズムを与える．","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":"2014-09-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"2014-AL-149"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":102915,"updated":"2025-01-21T10:38:37.262494+00:00","links":{},"created":"2025-01-18T23:48:01.789170+00:00"}