{"links":{},"id":97525,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00097525","sets":["6164:6165:6210:7362"]},"path":["7362"],"owner":"11","recid":"97525","title":["Square BreakerパズルのNP困難性"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-11-15"},"_buckets":{"deposit":"748d2203-d6ad-4f24-8faa-059b7bc0e7f1"},"_deposit":{"id":"97525","pid":{"type":"depid","value":"97525","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Square BreakerパズルのNP困難性","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Square BreakerパズルのNP困難性"},{"subitem_title":"NP-hardness of Square Breaker Puzzle","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2002-11-15","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学情報基盤センター"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Information Technology Center, University of Tokyo","subitem_text_language":"en"}]},"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/97525/files/IPSJ-GPWS2002020.pdf"},"date":[{"dateType":"Available","dateValue":"2002-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2002020.pdf","filesize":[{"value":"267.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"0e12cc29-1d72-49ae-9be4-dae36d3ba3e7","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"田中, 哲朗"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tanaka, Tetsuro","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Square BreakerはInternational Collegiate Programming Contest（ICPC）2001年アジア予選taejon大会で出題されたマッチ棒を使ったパズルである．この問題は，NP困難であると予想されていたが，証明はされていなかった．本論文ではこの問題がNP困難であることを証明する．証明の結果自体には予想されたことでもありインパクトはないが，証明の過程自体は興味深いと思われる．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Square Breaker is a puzzle with matchsticks, which appeared as a problem of International Collegiate Programming Contest (ICPC) Asia regional Taejon in 2001. This problem has been assumed to be a NP-hard problem, but the proof has not been done. In this paper, we show that the problem is NP-hard. Although the result itself has been assumed to be true, the proof process is seemed to be interesting.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"139","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2002論文集"}],"bibliographicPageStart":"136","bibliographicIssueDates":{"bibliographicIssueDate":"2002-11-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"17","bibliographicVolumeNumber":"2002"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:44:00.832834+00:00","updated":"2025-01-21T12:51:44.946816+00:00"}