{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:48Z","timestamp":1740099648561,"version":"3.37.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030431198"},{"type":"electronic","value":"9783030431204"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_26","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"333-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LaserTank is NP-Complete"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2176-0554","authenticated-orcid":false,"given":"Per","family":"Alexandersson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3411-8766","authenticated-orcid":false,"given":"Petter","family":"Restadh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151\u2013158. ACM, New York (1971). \nhttps:\/\/doi.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047"},{"key":"26_CR2","unstructured":"Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: Tetris is hard, even to approximate. Technical report, MIT-LCS-TR-865. MIT, Cambridge (2002). \nhttps:\/\/arxiv.org\/abs\/cs\/0210020"},{"issue":"4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/s0925-7721(99)00017-6","volume":"13","author":"D Dor","year":"1999","unstructured":"Dor, D., Zwick, U.: SOKOBAN and other motion planning problems. Comput. Geom. 13(4), 215\u2013228 (1999). \nhttps:\/\/doi.org\/10.1016\/s0925-7721(99)00017-6","journal-title":"Comput. Geom."},{"issue":"1\u20132","key":"26_CR4","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1016\/s0304-3975(01)00173-6","volume":"270","author":"GW Flake","year":"2002","unstructured":"Flake, G.W., Baum, E.B.: Rush Hour is PSPACE-complete, or \u201cWhy you should generously tip parking lot attendants\u201d. Theor. Comput. Sci. 270(1\u20132), 895\u2013911 (2002). \nhttps:\/\/doi.org\/10.1016\/s0304-3975(01)00173-6","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/bf03025367","volume":"22","author":"R Kaye","year":"2000","unstructured":"Kaye, R.: Minesweeper is NP-complete. Math. Intell. 22(2), 9\u201315 (2000). \nhttps:\/\/doi.org\/10.1007\/bf03025367","journal-title":"Math. Intell."},{"issue":"4","key":"26_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00283-011-9256-x","volume":"33","author":"A Scott","year":"2011","unstructured":"Scott, A., Stege, U., van Rooij, I.: Minesweeper may not be NP-complete but is hard nonetheless. Math. Intell. 33(4), 5\u201317 (2011). \nhttps:\/\/doi.org\/10.1007\/s00283-011-9256-x","journal-title":"Math. Intell."},{"key":"26_CR7","doi-asserted-by":"publisher","unstructured":"Viglietta, G.: Gaming is a hard job, but someone has to do it! Theory Comput. Syst. 54(4), 595\u2013621 (2013). \nhttps:\/\/doi.org\/10.1007\/s00224-013-9497-5","DOI":"10.1007\/s00224-013-9497-5"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:15:33Z","timestamp":1584490533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}