WEKO3
アイテム
{"_buckets": {"deposit": "cf8cd643-af82-4a98-93a6-039c3ed862c1"}, "_deposit": {"created_by": 3, "id": "4443", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "4443"}, "status": "published"}, "_oai": {"id": "oai:toyama.repo.nii.ac.jp:00004443", "sets": ["603"]}, "author_link": ["57417", "57421", "57420", "57419", "57418", "57422"], "item_3_alternative_title_19": {"attribute_name": "その他(別言語等)のタイトル", "attribute_value_mlt": [{"subitem_alternative_title": "On the time Complexity of Methods to Derive the Disjoint Disjunctive Form of Logical Expressions"}]}, "item_3_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1992-03", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "62", "bibliographicPageStart": "51", "bibliographicVolumeNumber": "43", "bibliographic_titles": [{"bibliographic_title": "富山大学工学部紀要"}]}]}, "item_3_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In this paper, we deal with the time complexty of (our) MA method, (SASAO\u0027s) SAS method and (CHAN\u0027s) DT method to derive the disjoint disjunctive form of a binary function with p-valued input. The times complexity of MA method is derived directly by estimating the number of trouble expended on each step of the algorithm for one of the function which has the maximum number of terms in the case of n-variables. That of SAS method and DT method which belong to tree type algorithms is derived by enumerating the summation of the number of terms at each node of those trees for the same function. The following time complexities are shown: for MA method, 0 (np^\u003c2n\u003e): both of SAS method and DT method, 0 (n^2p^n).", "subitem_description_type": "Abstract"}, {"subitem_description": "p値入力2値関数を分離加法形式で表す3つの方法,(我々の)MA法,(笹尾の)SAS法,(CHANの) DT法の時間計算量を求めている。\nMA法の時間計算量は,n変数の関数で一番項数の多い関数の一つについて,アルゴリズムの各ステップで必要な手数を直接求めて算出している。\nDT法,SAS法の時間計算量は,これらが木形アルゴリズムなので,同じ関数について各分岐点での項の総数を算出することにより導いている。\n結果は,MA法ではO(np^2n),SAS法,DT法ではともにO(n^2p^n)となる。", "subitem_description_type": "Abstract"}]}, "item_3_description_40": {"attribute_name": "資源タイプ(DSpace)", "attribute_value_mlt": [{"subitem_description": "Article", "subitem_description_type": "Other"}]}, "item_3_description_6": {"attribute_name": "引用", "attribute_value_mlt": [{"subitem_description": "富山大学工学部紀要,43, Page 51-62", "subitem_description_type": "Other"}]}, "item_3_full_name_3": {"attribute_name": "著者別名", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "57420", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "Matsuda, Hideo"}]}, {"nameIdentifiers": [{"nameIdentifier": "57421", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "Miyagoshi, Takashi"}]}, {"nameIdentifiers": [{"nameIdentifier": "57422", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "Hatakeyama, Toyomasa"}]}]}, "item_3_identifier_registration": {"attribute_name": "ID登録", "attribute_value_mlt": [{"subitem_identifier_reg_text": "10.15099/00004437", "subitem_identifier_reg_type": "JaLC"}]}, "item_3_publisher_33": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "富山大学工学部"}]}, "item_3_source_id_10": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AN00175872", "subitem_source_identifier_type": "NCID"}]}, "item_3_source_id_8": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "03871339", "subitem_source_identifier_type": "ISSN"}]}, "item_3_subject_22": {"attribute_name": "国立国会図書館分類", "attribute_value_mlt": [{"subitem_subject": "ZM2", "subitem_subject_scheme": "NDLC"}]}, "item_3_version_type_16": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "松田, 秀雄"}], "nameIdentifiers": [{"nameIdentifier": "57417", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "宮越, 隆"}], "nameIdentifiers": [{"nameIdentifier": "57418", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "畠山, 豊正"}], "nameIdentifiers": [{"nameIdentifier": "57419", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-02-16"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "Kokiyo_43_01_Page051to062.pdf", "filesize": [{"value": "2.2 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 2200000.0, "url": {"label": "Kokiyo_43_01_Page051to062.pdf", "url": "https://toyama.repo.nii.ac.jp/record/4443/files/Kokiyo_43_01_Page051to062.pdf"}, "version_id": "dc44bf8c-8a43-4c9c-a0d2-5919469e4c34"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "論理式", "subitem_subject_scheme": "Other"}, {"subitem_subject": "分離加法形式", "subitem_subject_scheme": "Other"}, {"subitem_subject": "時間計算量", "subitem_subject_scheme": "Other"}, {"subitem_subject": "MA法", "subitem_subject_scheme": "Other"}, {"subitem_subject": "SAS法", "subitem_subject_scheme": "Other"}, {"subitem_subject": "DT法", "subitem_subject_scheme": "Other"}, {"subitem_subject": "プログラム", "subitem_subject_scheme": "Other"}, {"subitem_subject": "プログラム化", "subitem_subject_scheme": "Other"}, {"subitem_subject": "計算機", "subitem_subject_scheme": "Other"}, {"subitem_subject": "木形アルゴリズム", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "論理式を分離加法形式で表す手法の時間計算量について", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "論理式を分離加法形式で表す手法の時間計算量について"}]}, "item_type_id": "3", "owner": "3", "path": ["603"], "permalink_uri": "https://doi.org/10.15099/00004437", "pubdate": {"attribute_name": "公開日", "attribute_value": "2012-10-11"}, "publish_date": "2012-10-11", "publish_status": "0", "recid": "4443", "relation": {}, "relation_version_is_last": true, "title": ["論理式を分離加法形式で表す手法の時間計算量について"], "weko_shared_id": -1}
論理式を分離加法形式で表す手法の時間計算量について
https://doi.org/10.15099/00004437
https://doi.org/10.15099/00004437a45f06fb-aea2-42ee-854b-0a33c8fcfd59
名前 / ファイル | ライセンス | アクション |
---|---|---|
Kokiyo_43_01_Page051to062.pdf (2.2 MB)
|
|
Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2012-10-11 | |||||
タイトル | ||||||
タイトル | 論理式を分離加法形式で表す手法の時間計算量について | |||||
言語 | ||||||
言語 | jpn | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 論理式 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 分離加法形式 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 時間計算量 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | MA法 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | SAS法 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | DT法 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | プログラム | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | プログラム化 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 計算機 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 木形アルゴリズム | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
ID登録 | ||||||
ID登録 | 10.15099/00004437 | |||||
ID登録タイプ | JaLC | |||||
著者 |
松田, 秀雄
× 松田, 秀雄× 宮越, 隆× 畠山, 豊正 |
|||||
著者別名 | ||||||
姓名 | Matsuda, Hideo | |||||
著者別名 | ||||||
姓名 | Miyagoshi, Takashi | |||||
著者別名 | ||||||
姓名 | Hatakeyama, Toyomasa | |||||
その他(別言語等)のタイトル | ||||||
その他のタイトル | On the time Complexity of Methods to Derive the Disjoint Disjunctive Form of Logical Expressions | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | In this paper, we deal with the time complexty of (our) MA method, (SASAO's) SAS method and (CHAN's) DT method to derive the disjoint disjunctive form of a binary function with p-valued input. The times complexity of MA method is derived directly by estimating the number of trouble expended on each step of the algorithm for one of the function which has the maximum number of terms in the case of n-variables. That of SAS method and DT method which belong to tree type algorithms is derived by enumerating the summation of the number of terms at each node of those trees for the same function. The following time complexities are shown: for MA method, 0 (np^<2n>): both of SAS method and DT method, 0 (n^2p^n). | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | p値入力2値関数を分離加法形式で表す3つの方法,(我々の)MA法,(笹尾の)SAS法,(CHANの) DT法の時間計算量を求めている。 MA法の時間計算量は,n変数の関数で一番項数の多い関数の一つについて,アルゴリズムの各ステップで必要な手数を直接求めて算出している。 DT法,SAS法の時間計算量は,これらが木形アルゴリズムなので,同じ関数について各分岐点での項の総数を算出することにより導いている。 結果は,MA法ではO(np^2n),SAS法,DT法ではともにO(n^2p^n)となる。 |
|||||
引用 | ||||||
内容記述タイプ | Other | |||||
内容記述 | 富山大学工学部紀要,43, Page 51-62 | |||||
書誌情報 |
富山大学工学部紀要 巻 43, p. 51-62, 発行日 1992-03 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 03871339 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AN00175872 | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
国立国会図書館分類 | ||||||
主題Scheme | NDLC | |||||
主題 | ZM2 | |||||
出版者 | ||||||
出版者 | 富山大学工学部 | |||||
資源タイプ(DSpace) | ||||||
内容記述タイプ | Other | |||||
内容記述 | Article |