{"created":"2025-01-19T01:34:47.074232+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233378","sets":["1164:2592:11452:11525"]},"path":["11525"],"owner":"44499","recid":"233378","title":["テント符号の空間計算量の平滑化解析"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-14"},"_buckets":{"deposit":"09580a2e-0d58-4144-9c79-38701a5ae328"},"_deposit":{"id":"233378","pid":{"type":"depid","value":"233378","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"テント符号の空間計算量の平滑化解析","author_link":["633788","633789"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"テント符号の空間計算量の平滑化解析"}]},"item_type_id":"4","publish_date":"2024-03-14","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学"},{"subitem_text_value":"滋賀大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Shiga University","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/233378/files/IPSJ-AL24197003.pdf","label":"IPSJ-AL24197003.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL24197003.pdf","filesize":[{"value":"941.7 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":"317dd1c0-2fd6-44cd-a811-ee1c737c7239","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岡田, 真明"}],"nameIdentifiers":[{}]},{"creatorNames":[{"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_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":"本研究の動機は，カオス系列を効率的に計算することはできるかという問いにある．例えば，β展開やテント写像，ロジスティック写像といったカオス写像によって生成されるビット列の第 n ビットを o(n) 時間/空間で得ることはできるだろうか．本稿ではテント写像の空間計算量について肯定的な回答を与える．具体的には，与えられたビット列がテント符号であるか否かの判定問題について，平滑化解析の意味で空間計算量が O(log2 n) であることを示す．","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":"2024-03-14","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2024-AL-197"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"links":{},"id":233378,"updated":"2025-01-19T10:07:11.496430+00:00"}