{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:16Z","timestamp":1759639036467,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_23","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"274-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Turing Tumble Is P(SPACE)-Complete"],"prefix":"10.1007","author":[{"given":"Matthew P.","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"23_CR1","unstructured":"Aaronson, S.: The power of the Digi-Comp II: my first conscious paperlet, blogpost on Shtetl-Optimized (2010). https:\/\/www.scottaaronson.com\/blog\/?p=1902"},{"issue":"4","key":"23_CR2","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s00224-009-9172-z","volume":"45","author":"E Allender","year":"2009","unstructured":"Allender, E., Barrington, D.A.M., Chakraborty, T., Datta, S., Roy, S.: Planar and grid graph reachability problems. Theory Comput. Syst. 45(4), 675\u2013723 (2009)","journal-title":"Theory Comput. Syst."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Becker, A.T., Demaine, E.D., Fekete, S.P., Lonsford, J., Morris-Wright, R.: Particle computation: complexity, algorithms, and logic. Nat. Comput. 18(1), 1\u201321 (2019)","DOI":"10.1007\/s11047-017-9666-6"},{"key":"23_CR4","unstructured":"Bickford, N.: Marble runs and Turing machines. Talk at Gathering 4 Gardner 11, March 2014. https:\/\/nbickford.wordpress.com\/2014\/03\/25\/images-from-marble-runs-and-turing-machines\/"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2635822","volume":"6","author":"SA Cook","year":"2014","unstructured":"Cook, S.A., Filmus, Y., L\u00ea, D.T.M.: The complexity of the comparator circuit value problem. ACM Trans. Comput. Theory 6(4), 15 (2014)","journal-title":"ACM Trans. Comput. Theory"},{"key":"23_CR6","unstructured":"Demaine, E.D., Grosof, I., Lynch, J., Rudoy, M.: Computational complexity of motion planning of a robot through simple gadgets. In: FUN, pp. 18:1\u201318:21 (2018)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hearn, R.A.: Constraint logic: a uniform framework for modeling computation as games. In: CCC, pp. 149\u2013162 (2008)","DOI":"10.1109\/CCC.2008.35"},{"key":"23_CR8","unstructured":"Education Science Research, Incorporated: DIGI-COMP II instruction manual. https:\/\/cdn.evilmadscientist.com\/KitInstrux\/DCII-manual.pdf"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.dam.2013.10.038","volume":"168","author":"R Ganian","year":"2014","unstructured":"Ganian, R., Hlin\u011bn\u1ef3, P., Kneis, J., Langer, A., Obdr\u017e\u00e1lek, J., Rossmanith, P.: Digraph width measures in parameterized algorithmics. Discrete Appl. Math. 168, 88\u2013107 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"23_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.37236\/12","volume":"19","author":"GP Giacaglia","year":"2012","unstructured":"Giacaglia, G.P., Levine, L., Propp, J., Zayas-Palmer, L.: Local-to-global principles for the hitting sequence of a rotor walk. Electron. J. Comb. 19(1), 5 (2012)","journal-title":"Electron. J. Comb."},{"key":"23_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"R Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L., et al.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)"},{"key":"23_CR12","doi-asserted-by":"crossref","DOI":"10.1201\/b10581","volume-title":"Games, Puzzles, and Computation","author":"RA Hearn","year":"2009","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. CRC Press, Boca Raton (2009)"},{"key":"23_CR13","unstructured":"Holroyd, A.E., Levine, L., Winkler, P.: Abelian logic gates. arXiv:1511.00422 (2015)"},{"key":"23_CR14","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees Hypercubes","author":"FT Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees Hypercubes. Morgan Kaufmann, San Francisco (1992)"},{"issue":"1\u20132","key":"23_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0167-2789(84)90252-5","volume":"10","author":"N Margolus","year":"1984","unstructured":"Margolus, N.: Physics-like models of computation. Phys. D: Nonlinear Phenom. 10(1\u20132), 81\u201395 (1984)","journal-title":"Phys. D: Nonlinear Phenom."},{"key":"23_CR16","unstructured":"Meiburg, A.: Comment #24 on Aaronson [1] (2010). https:\/\/www.scottaaronson.com\/blog\/?p=1902#comment-111711"},{"issue":"1\u20132","key":"23_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2010.09.015","volume":"412","author":"A Okhotin","year":"2011","unstructured":"Okhotin, A.: A simple P-complete problem and its language-theoretic representations. Theoret. Comput. Sci. 412(1\u20132), 68\u201382 (2011)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:56:59Z","timestamp":1710334619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","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":"95","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":"30","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":"32% - 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":"14","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)"}}]}}