{"updated":"2025-01-22T16:29:55.562128+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00031758","sets":["1164:2592:2607:2613"]},"path":["2613"],"owner":"1","recid":"31758","title":["整数分割の列挙"],"pubdate":{"attribute_name":"公開日","attribute_value":"2006-01-20"},"_buckets":{"deposit":"ccf79032-dfee-494c-81f5-c5b5e55633c4"},"_deposit":{"id":"31758","pid":{"type":"depid","value":"31758","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"整数分割の列挙","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"整数分割の列挙"},{"subitem_title":"Constant Time Generation of Integer Partitions","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2006-01-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"群馬大"},{"subitem_text_value":"群馬大"},{"subitem_text_value":"ERATO QCI Project JST"},{"subitem_text_value":"群馬大"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Gunma Univ.","subitem_text_language":"en"},{"subitem_text_value":"Gunma univ.","subitem_text_language":"en"},{"subitem_text_value":"ERATO QCI Project JST","subitem_text_language":"en"},{"subitem_text_value":"Gunma univ.","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/31758/files/IPSJ-AL06104005.pdf"},"date":[{"dateType":"Available","dateValue":"2008-01-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL06104005.pdf","filesize":[{"value":"1.1 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":"222d0afc-d73e-4248-af0d-ef6974965127","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2006 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山中, 克久"},{"creatorName":"川野, 晋一郎"},{"creatorName":"菊地, 洋右"},{"creatorName":"中野, 眞一"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Katsuhisa, YAMANAKA","creatorNameLang":"en"},{"creatorName":"Shin-ichiro, KAWANO","creatorNameLang":"en"},{"creatorName":"Yosuke, KIKUCHI","creatorNameLang":"en"},{"creatorName":"Shin-ichi, NAKANO","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本文では  正の整数 n の整数分割を列挙するアルゴリズムを与える.この問題は  組み合わせ論において基本的な問題の1つであり  長い間  広く研究されてきた.これまで  整数分割1つ当たり平均定数時間で列挙する方法しか知られていなかった.我々は  与えられた整数の整数分割を  最悪でも1つ当たり定数時間で重複なく列挙するアルゴリズムを与える. また  条件付きの整数分割を定数時間で列挙するアルゴリズムをいくつか与える.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper we give a simple algorithm to generate all partitions of a positive integer n. The problem is one of basic problems in combinatorics, and have been extensively studied for a long time. Our algorithm generates each partition of a given integer in constant time for each without repetition, while known best algorithm generates each partition in constant time on \"average\". Also, we propose some algorithms to generate all partitions of an integer with some property in constant time.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"34","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"27","bibliographicIssueDates":{"bibliographicIssueDate":"2006-01-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7(2006-AL-104)","bibliographicVolumeNumber":"2006"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:01.013378+00:00","id":31758,"links":{}}