{"created":"2022-10-25T00:17:52.736604+00:00","id":2001212,"links":{},"metadata":{"_buckets":{"deposit":"203a411f-a282-43a2-a3e0-c3148ff012bd"},"_deposit":{"id":"2001212","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"2001212"},"status":"published"},"_oai":{"id":"oai:soar-ir.repo.nii.ac.jp:02001212","sets":["1221:1222"]},"author_link":[],"item_1628147817048":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_6_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2020-05-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"92","bibliographicPageStart":"89","bibliographicVolumeNumber":"28","bibliographic_titles":[{"bibliographic_title":"FORMALIZED MATHEMATICS"}]}]},"item_6_description_20":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"The subset sum problem is a basic problem in the field of theoretical computer science, especially in the complexity theory. The input is a sequence of positive integers and a target positive integer. The task is to determine if there exists a subsequence of the input sequence with sum equal to the target integer. It is known that the problem is NP-hard and can be solved by dynamic programming in pseudo-polynomial time. In this article we formalize the recurrence relation of the dynamic programming.","subitem_description_type":"Abstract"}]},"item_6_description_30":{"attribute_name":"資源タイプ（コンテンツの種類）","attribute_value_mlt":[{"subitem_description":"Article","subitem_description_type":"Other"}]},"item_6_description_5":{"attribute_name":"引用","attribute_value_mlt":[{"subitem_description":"FORMALIZED MATHEMATICS 28(1) : 89-92(2020)","subitem_description_type":"Other"}]},"item_6_link_3":{"attribute_name":"信州大学研究者総覧へのリンク","attribute_value_mlt":[{"subitem_link_text":"藤原, 洋志","subitem_link_url":"https://soar-rd.shinshu-u.ac.jp/profile/ja.OmSVOFnU.html"},{"subitem_link_text":"山本, 博章","subitem_link_url":"https://soar-rd.shinshu-u.ac.jp/profile/ja.ONfpOCSh.html"}]},"item_6_relation_48":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"10.2478/forma-2020-0007"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.2478/forma-2020-0007","subitem_relation_type_select":"DOI"}}]},"item_6_rights_62":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"© 2020 University of Białystok"}]},"item_6_source_id_35":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1898-9934","subitem_source_identifier_type":"EISSN"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Fujiwara, Hiroshi","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Watari, Hokuto","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Yamamoto, Hiroaki","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2022-10-04"}],"filename":"16K00033_3.pdf","format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"16K00033_3.pdf","url":"https://soar-ir.repo.nii.ac.jp/record/2001212/files/16K00033_3.pdf"},"version_id":"a4b49ae9-3ebf-4ed2-a5fc-754fdb97e9c5"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"dynamic programming","subitem_subject_scheme":"Other"},{"subitem_subject":"subset sum problem","subitem_subject_scheme":"Other"},{"subitem_subject":"complexity theory","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Dynamic Programming for the Subset Sum Problem","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Dynamic Programming for the Subset Sum Problem","subitem_title_language":"en"}]},"item_type_id":"6","owner":"1","path":["1222"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2022-10-04"},"publish_date":"2022-10-04","publish_status":"0","recid":"2001212","relation_version_is_last":true,"title":["Dynamic Programming for the Subset Sum Problem"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2022-12-14T04:15:37.179457+00:00"}