{"links":{},"id":142073,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00142073","sets":["581:7706:7711"]},"path":["7711"],"owner":"11","recid":"142073","title":["Fillmat is NP-Complete and ASP-Complete"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-05-15"},"_buckets":{"deposit":"09d96028-e978-4a26-a90d-acb7dad068f4"},"_deposit":{"id":"142073","pid":{"type":"depid","value":"142073","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Fillmat is NP-Complete and ASP-Complete","author_link":["209512","209511","209514","209513"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Fillmat is NP-Complete and ASP-Complete"},{"subitem_title":"Fillmat is NP-Complete and ASP-Complete","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集：娯楽の離散数理] computational complexity, NP-completeness, ASP-completeness, pencil-and-paper puzzle, Fillmat","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2015-05-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Osaka Electro-Communication University"},{"subitem_text_value":"Osaka Electro-Communication University"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Osaka Electro-Communication University","subitem_text_language":"en"},{"subitem_text_value":"Osaka Electro-Communication University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":11,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/142073/files/IPSJ-JNL5605013.pdf","label":"IPSJ-JNL5605013"},"date":[{"dateType":"Available","dateValue":"2017-05-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5605013.pdf","filesize":[{"value":"2.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"61a6702d-d9e8-4630-a1d0-a8f5989cf87d","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Uejima, Akihiro"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Suzuki, Hiroaki"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Uejima, Akihiro","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Suzuki, Hiroaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We study the computational complexity of a packing puzzle Fillmat, which is a type of pencil-and-paper puzzles made by Japanese puzzle publisher Nikoli. We show that the problem to decide if a given instance of Fillmat has a solution is NP-complete by a reduction from the circuit-satisfiability problem (Circuit-SAT). Our reduction is carefully designed so that we can also prove \\textbf{ASP}-completeness of the another-solution-problem.\n\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.23.310\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We study the computational complexity of a packing puzzle Fillmat, which is a type of pencil-and-paper puzzles made by Japanese puzzle publisher Nikoli. We show that the problem to decide if a given instance of Fillmat has a solution is NP-complete by a reduction from the circuit-satisfiability problem (Circuit-SAT). Our reduction is carefully designed so that we can also prove \\textbf{ASP}-completeness of the another-solution-problem.\n\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.23.310\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2015-05-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"56"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:19:34.312502+00:00","updated":"2025-01-20T06:43:58.482255+00:00"}