{"created":"2021-03-01T06:43:40.094977+00:00","id":8290,"links":{},"metadata":{"_buckets":{"deposit":"b67e559d-92c4-493e-9cd9-3a1bb4106b46"},"_deposit":{"id":"8290","owners":[],"pid":{"revision_id":0,"type":"depid","value":"8290"},"status":"published"},"_oai":{"id":"oai:tsukuba.repo.nii.ac.jp:00008290","sets":["3:233:254"]},"author_link":["34580"],"item_12_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1999","bibliographicIssueDateType":"Issued"}}]},"item_12_date_granted_46":{"attribute_name":"学位授与年月日","attribute_value_mlt":[{"subitem_dategranted":"1999-03-25"}]},"item_12_degree_grantor_44":{"attribute_name":"学位授与大学","attribute_value_mlt":[{"subitem_degreegrantor":[{"subitem_degreegrantor_language":"ja","subitem_degreegrantor_name":"筑波大学"},{"subitem_degreegrantor_language":"en","subitem_degreegrantor_name":"University of Tsukuba"}],"subitem_degreegrantor_identifier":[{"subitem_degreegrantor_identifier_name":"12102","subitem_degreegrantor_identifier_scheme":"kakenhi"}]}]},"item_12_degree_name_43":{"attribute_name":"取得学位","attribute_value_mlt":[{"subitem_degreename":"博士（理学）"},{"subitem_degreename":"Doctor of Philosophy in Science"}]},"item_12_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"各種の数学的対象に対する計算複雑さの尺度は、これまで様々な研究者によって提唱されてきた。例えば、多項式時間 Turing 次数、Kolmogorov 計算量、回路計算量など。にもかかわらず、計算複雑さについて、いまだに性質がよく知られていない計算的対象は、数多い。 ...","subitem_description_language":"ja","subitem_description_type":"Abstract"}]},"item_12_description_45":{"attribute_name":"学位授与年度","attribute_value_mlt":[{"subitem_description":"1998","subitem_description_type":"Other"}]},"item_12_dissertation_number_47":{"attribute_name":"報告番号","attribute_value_mlt":[{"subitem_dissertationnumber":"乙第1498号"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"鈴木, 登志雄","creatorNameLang":"ja"},{"creatorName":"Suzuki, Toshio","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"34580","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2013-12-18"}],"displaytype":"detail","filename":"B1498.pdf","filesize":[{"value":"87.7 kB"}],"format":"application/pdf","mimetype":"application/pdf","url":{"objectType":"abstract","url":"https://tsukuba.repo.nii.ac.jp/record/8290/files/B1498.pdf"},"version_id":"44d47490-bfa5-4ccc-8061-492fc0b9ec5a"},{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2013-12-18"}],"displaytype":"detail","filename":"1.pdf","filesize":[{"value":"62.6 MB"}],"format":"application/pdf","mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://tsukuba.repo.nii.ac.jp/record/8290/files/1.pdf"},"version_id":"31ee78ac-4bcd-4bfc-bd7f-9883ab1966f2"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"doctoral thesis","resourceuri":"http://purl.org/coar/resource_type/c_db06"}]},"item_title":"Computational complexity of Boolean formulas with query symbols","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Computational complexity of Boolean formulas with query symbols","subitem_title_language":"en"},{"subitem_title":"クエリー記号付きブール式の計算複雑さ","subitem_title_language":"ja"}]},"item_type_id":"12","owner":"1","path":["254"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2007-07-25"},"publish_date":"2007-07-25","publish_status":"0","recid":"8290","relation_version_is_last":true,"title":["Computational complexity of Boolean formulas with query symbols"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-05-02T01:10:47.509125+00:00"}