{"created":"2023-05-15T15:32:18.142993+00:00","id":5148,"links":{},"metadata":{"_buckets":{"deposit":"eccd258c-2ce1-4e92-b8e8-71bf498e523f"},"_deposit":{"created_by":17,"id":"5148","owners":[17],"pid":{"revision_id":0,"type":"depid","value":"5148"},"status":"published"},"_oai":{"id":"oai:barrel.repo.nii.ac.jp:00005148","sets":["1:536"]},"author_link":["32405","32406","32407"],"item_1_biblio_info_5":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2017-08","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"734","bibliographicPageStart":"730","bibliographicVolumeNumber":"25","bibliographic_titles":[{},{"bibliographic_title":"Journal of Information Processing","bibliographic_titleLang":"en"}]}]},"item_1_description_18":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"The Building puzzle（a.k.a., the Skyscraper) is a Latin square completion-type puzzle like Sudoku,KenKen. and Futoshiki. Recently, Iwamoto and Matsui showed the NP-completeness of the decision problem version of this　puzzle, which asks whether a given instance has a solution or not. We provide a stronger result in the present paper;it is still NP-complete to decide whether we can complete a single line of the grid (i.e., a l×n or an n×l subgrid)without violating the rule.","subitem_description_type":"Abstract"}]},"item_1_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"32407","nameIdentifierScheme":"WEKO"}],"names":[{"name":"原口, 和也"}]}]},"item_1_publisher_6":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"lnformatron Processing Society of Japan"}]},"item_1_relation_8":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"info:doi/10.2197/ipsjjip.25. 730","subitem_relation_type_select":"DOI"}}]},"item_1_rights_12":{"attribute_name":"権利表記","attribute_value_mlt":[{"subitem_rights":"© 2017 lnformatron Processing Society of Japan"}]},"item_1_rights_14":{"attribute_name":"著作権注記","attribute_value_mlt":[{"subitem_rights":"利用は著作権の範囲内に限定される"}]},"item_1_source_id_11":{"attribute_name":"書誌ID（NCID）","attribute_value_mlt":[{"subitem_source_identifier":"AA11509898","subitem_source_identifier_type":"NCID"}]},"item_1_source_id_7":{"attribute_name":"ISSN / EISSN","attribute_value_mlt":[{"subitem_source_identifier":"03876101","subitem_source_identifier_type":"ISSN"}]},"item_1_subject_16":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"410","subitem_subject_scheme":"NDC"}]},"item_1_subject_17":{"attribute_name":"NIIサブジェクト","attribute_value_mlt":[{"subitem_subject":"数学","subitem_subject_scheme":"Other"}]},"item_1_version_type_15":{"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":"Haraguchi, Kazuya"}],"nameIdentifiers":[{"nameIdentifier":"32405","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Tanaka, Ryoya"}],"nameIdentifiers":[{"nameIdentifier":"32406","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-04-24"}],"displaytype":"detail","filename":"Journal of Information Processing_Vol.25 _730-734.pdf","filesize":[{"value":"1.1 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"Journal of Information Processing_Vol.25 _730-734","url":"https://barrel.repo.nii.ac.jp/record/5148/files/Journal of Information Processing_Vol.25 _730-734.pdf"},"version_id":"f2eac084-52cd-408e-8b20-8b6622028288"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"computational complexity","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Latin square completion type puzzle","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Building puzzle","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Skyscraper","subitem_subject_language":"en","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":"The Building Puzzle Is Still Hard Even in the Single Lined Version","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"The Building Puzzle Is Still Hard Even in the Single Lined Version"},{"subitem_title":"The Building Puzzle Is Still Hard Even in the Single Lined Version","subitem_title_language":"en"}]},"item_type_id":"1","owner":"17","path":["536"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-04-25"},"publish_date":"2018-04-25","publish_status":"0","recid":"5148","relation_version_is_last":true,"title":["The Building Puzzle Is Still Hard Even in the Single Lined Version"],"weko_creator_id":"17","weko_shared_id":-1},"updated":"2023-05-15T16:13:57.166616+00:00"}