{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:17:33Z","timestamp":1743103053740,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-50026-9_17","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"237-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computational Hardness of Multidimensional Subtraction Games"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Gurvich","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9822-1060","authenticated-orcid":false,"given":"Mikhail","family":"Vyalyi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","DOI":"10.1201\/b10691","volume-title":"Lessons in Play: An Introduction to Combinatorial Game Theory","author":"M Albert","year":"2007","unstructured":"Albert, M., Nowakowski, R., Wolfe, D.: Lessons in Play: An Introduction to Combinatorial Game Theory. Taylor & Francis, Abington (2007)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, vol. 1\u20134. A.K. Peters, Natick (2001\u20132004)","DOI":"10.1201\/9780429487309"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/s00182-012-0338-6","volume":"42","author":"E Boros","year":"2013","unstructured":"Boros, E., Gurvich, V., Oudalov, V.: A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory. Int J. Game Theory 42(4), 891\u2013915 (2013). \nhttps:\/\/doi.org\/10.1007\/s00182-012-0338-6","journal-title":"Int J. Game Theory"},{"key":"17_CR4","unstructured":"Boros, E., Gurvich, V., Ho, N.B., Makino, K., Mursic, P.: Tetris hypergraphs and combinations of impartial games. CoRR abs\/1701.02819 (2017). \nhttp:\/\/arxiv.org\/abs\/1701.02819"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2017.08.007","volume":"239","author":"E Boros","year":"2018","unstructured":"Boros, E., Gurvich, V., Ho, N.B., Makino, K., Mursic, P.: On the Sprague-Grundy function of exact $$k$$-nim. Discrete Appl. Math. 239, 1\u201314 (2018)","journal-title":"Discrete Appl. Math."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2019.09.041","volume":"799","author":"E Boros","year":"2019","unstructured":"Boros, E., Gurvich, V., Ho, N.B., Makino, K., Mursic, P.: Sprague-Grundy function of matroids and related hypergraphs. Theor. Comput. Sci. 799, 40\u201358 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.jcta.2019.02.006","volume":"165","author":"E Boros","year":"2019","unstructured":"Boros, E., Gurvich, V., Ho, N.B., Makino, K., Mursic, P.: Sprague-Grundy function of symmetric hypergraphs. J. Comb. Theory Ser. A 165, 176\u2013186 (2019)","journal-title":"J. Comb. Theory Ser. A"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Bouton, C.L.: Nim, a game with a complete mathematical theory. Ann. Math. 2nd Ser. 3, 35\u201339 (1901\u20131902)","DOI":"10.2307\/1967631"},{"key":"17_CR9","unstructured":"Conway, J.H.: On Numbers and Games. Academic Press, London, New York, San Francisco (1976)"},{"key":"17_CR10","unstructured":"Demaine, E.D., Hearn, R.A.: Playing games with algorithms: algorithmic combinatorial game theory. CoRR abs\/cs\/0106019v2 (2008). \nhttp:\/\/arxiv.org\/abs\/cs\/0106019v2"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"3169","DOI":"10.1016\/j.tcs.2010.05.007","volume":"411","author":"E Duch\u00eane","year":"2010","unstructured":"Duch\u00eane, E., Rigo, M.: Invariant games. Theor. Comput. Sci. 411, 3169\u20133180 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1080\/00029890.1982.11995454","volume":"89","author":"A Fraenkel","year":"1982","unstructured":"Fraenkel, A.: How to beat your Wythoff games\u2019 opponent on three fronts. Am. Math. Mon. 89, 353\u2013361 (1982)","journal-title":"Am. Math. Mon."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(84)90012-4","volume":"29","author":"A Fraenkel","year":"1984","unstructured":"Fraenkel, A.: Wythoff games, continued fractions, cedar trees and Fibonacci searches. Theor. Comput. Sci. 29, 49\u201373 (1984)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0021-9800(66)80016-9","volume":"1","author":"SW Golomb","year":"1966","unstructured":"Golomb, S.W.: A mathematical investigation of games of \u201ctake-away\u201d. J. Comb. Theory 1(4), 443\u2013458 (1966)","journal-title":"J. Comb. Theory"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0305004100031510","volume":"52","author":"PM Grundy","year":"1956","unstructured":"Grundy, P.M., Smith, C.: Disjunctive games with the last player losing. Proc. Camb. Philos. Soc. 52, 527\u2013533 (1956)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"17_CR16","unstructured":"Gurvich, V., Heubach, S., Ho, N.B., Chikin, N.: Slow $$k$$-nim integers. Electron. J. Comb. Number Theory 20, 1\u201319 (2020)"},{"key":"17_CR17","unstructured":"Gurvich, V., Ho, N.B.: Slow $$k$$-nim. RUTCOR Research Report RRR-03-2015 (2015)"},{"key":"17_CR18","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2006)","edition":"3"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01784796","volume":"9","author":"TA Jenkyns","year":"1980","unstructured":"Jenkyns, T.A., Mayberry, J.P.: The skeletion of an impartial game and the Nim-function of Moore\u2019s Nim$${}_k$$. Int J. Game Theory 9, 51\u201363 (1980). \nhttps:\/\/doi.org\/10.1007\/BF01784796","journal-title":"Int J. Game Theory"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Larsson, U., W\u00e4stlund, W.: From heaps of matches to the limits of computability. Electron. J. Comb. 20(3), #P41 (2013)","DOI":"10.37236\/2244"},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"93","DOI":"10.2307\/1967321","volume":"11","author":"E Moore","year":"1910","unstructured":"Moore, E.: A generalization of the game called Nim. Ann. Math. Second Ser. 11(3), 93\u201394 (1910)","journal-title":"Ann. Math. Second Ser."},{"key":"17_CR22","volume-title":"Theory of Games and Economic Behaviour","author":"J von Neumann","year":"1944","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behaviour. Princeton University Press, Princeton (1944)"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"TJ Shaefer","year":"1978","unstructured":"Shaefer, T.J.: On the complexity of some two-person perfect-information games. J. Comput. Syst. Sci. 16, 185\u2013225 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR24","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2013","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Cengage Learning, Boston (2013)"},{"key":"17_CR25","first-page":"199","volume":"7","author":"W Wythoff","year":"1907","unstructured":"Wythoff, W.: A modification of the game of Nim. Nieuw Archief voor Wiskunde 7, 199\u2013202 (1907)","journal-title":"Nieuw Archief voor Wiskunde"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:06:33Z","timestamp":1592780793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_17","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":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"49","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":"25","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":"0","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":"51% - 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":">= 3","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":"7","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)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}