{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:51:42Z","timestamp":1742939502578,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031184604"},{"type":"electronic","value":"9783031184611"}],"license":[{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-18461-1_51","type":"book-chapter","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T07:15:14Z","timestamp":1665558914000},"page":"776-795","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized-NL Completeness of\u00a0Combinatorial Problems by\u00a0Short Logarithmic-Space Reductions and\u00a0Immediate Consequences of\u00a0the\u00a0Linear Space Hypothesis"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Yamakami","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,13]]},"reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/PL00001603","volume":"9","author":"C \u00c0lvarez","year":"2000","unstructured":"\u00c0lvarez, C., Greenlaw, R.: A compendium of problems complete for symmetric logarithmic space. Comput. Complex. 9, 123\u2013142 (2000)","journal-title":"Comput. Complex."},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0213028","volume":"13","author":"A Chandra","year":"1984","unstructured":"Chandra, A., Stockmeyer, L., Vishkin, U.: Constant depth reducibility. SIAM J. Comput. 13, 423\u2013439 (1984)","journal-title":"SIAM J. Comput."},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedure. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"SA Cook","year":"1987","unstructured":"Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. J. Algorithms 8, 385\u2013394 (1987)","journal-title":"J. Algorithms"},{"key":"51_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)"},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N Immerman","year":"1988","unstructured":"Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17, 935\u2013938 (1988)","journal-title":"SIAM J. Comput."},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(95)00017-7","volume":"54","author":"B Jenner","year":"1995","unstructured":"Jenner, B.: Knapsack problems for NL. Inf. Process. Lett. 54, 169\u2013174 (1995)","journal-title":"Inf. Process. Lett."},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01683259","volume":"10","author":"ND Jones","year":"1976","unstructured":"Jones, N.D., Lien, Y.E., Laaser, W.T.: New problems complete for nondeterministic log space. Math. Syst. Theory 10, 1\u201317 (1976)","journal-title":"Math. Syst. Theory"},{"key":"51_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1145\/62.322436","volume":"31","author":"JH Reif","year":"1984","unstructured":"Reif, J.H.: Symmetric complementation. J. ACM 31, 401\u2013421 (1984)","journal-title":"J. ACM"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17 (2008)","DOI":"10.1145\/1391289.1391291"},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00299636","volume":"26","author":"R Szelepcs\u00e9nyi","year":"1988","unstructured":"Szelepcs\u00e9nyi, R.: The method of forced enumeration for nondeterministic automata. Acta Informatica 26, 279\u2013284 (1988)","journal-title":"Acta Informatica"},{"key":"51_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-67089-8_13","volume-title":"Reachability Problems","author":"T Yamakami","year":"2017","unstructured":"Yamakami, T.: Parameterized graph connectivity and polynomial-time sub-linear-space short reductions. In: Hague, M., Potapov, I. (eds.) RP 2017. LNCS, vol. 10506, pp. 176\u2013191. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67089-8_13"},{"key":"51_CR14","unstructured":"Yamakami, T.: The 2CNF Boolean formula satisfiability problem and the linear space hypothesis. In: Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, vol. 83 of Leibniz International Proceedings in Informatics (LIPIcs), Leibniz-Zentrum f\u00fcr Informatik 2017, pp. 1\u201314 (2017). A corrected and complete version available as arXiv preprint"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2019.09.006","volume":"798","author":"T Yamakami","year":"2019","unstructured":"Yamakami, T.: State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis. Theor. Comput. Sci. 798, 2\u201322 (2019)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Networks and Systems","Proceedings of the Future Technologies Conference (FTC) 2022, Volume 1"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18461-1_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T07:29:50Z","timestamp":1665559790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18461-1_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,13]]},"ISBN":["9783031184604","9783031184611"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18461-1_51","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2022,10,13]]},"assertion":[{"value":"13 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FTC 2022","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Proceedings of the Future Technologies Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ftc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/saiconference.com\/FTC","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}