{"updated":"2025-01-21T02:43:25.469317+00:00","links":{},"id":124010,"created":"2025-01-19T00:04:00.188154+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00124010","sets":["6504:8043:8045"]},"path":["8045"],"owner":"1","recid":"124010","title":["充足可能性問題と双線形計画問題との関係"],"pubdate":{"attribute_name":"公開日","attribute_value":"1993-09-27"},"_buckets":{"deposit":"439061d4-0bdb-41ff-9544-40cf5a13ae3b"},"_deposit":{"id":"124010","pid":{"type":"depid","value":"124010","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"充足可能性問題と双線形計画問題との関係","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"充足可能性問題と双線形計画問題との関係"},{"subitem_title":"A relation between satisfiability problem and Bilinear programming","subitem_title_language":"en"}]},"item_type_id":"22","publish_date":"1993-09-27","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京農工大学工学部情報工学大講座"},{"subitem_text_value":"東京農工大学工学部情報工学大講座"}]},"item_22_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of Agriculture and Technology","subitem_text_language":"en"}]},"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/124010/files/KJ00001338690.pdf"},"date":[{"dateType":"Available","dateValue":"1993-09-27"}],"format":"application/pdf","filename":"KJ00001338690.pdf","filesize":[{"value":"140.9 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"7ab1da9e-bce6-4656-9b25-a8beefb4760b","displaytype":"detail","licensetype":"license_note"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"一般に,ある問題の難しさは,その問題を解くために必要とされる計算量のオーダーを用いて表現される。しかし,計算量というものは,問題の記述方法や計算モデルに依存して決定されるものである。そこで,本研究では,問題そのものが持つ灘しさを,計算モデルに依存しない不変量として表現する方法として,問題を数理計画問題として記述し,その際に必要となる変数の数により各問題の持つ難しさを表現することを試みた。次に,実際に・CNF論理式における充足可能性問題・O-1整数計画問題における判定問題・節点カバーの存在判定問題を数理計画問題(双線形計画問題)として記述した例を示す。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"98","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}],"bibliographicPageStart":"97","bibliographicIssueDates":{"bibliographicIssueDate":"1993-09-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"基礎理論及び基礎技術","bibliographicVolumeNumber":"第47回"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}