{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T23:25:55Z","timestamp":1677713155588},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,6]],"date-time":"2012-11-06T00:00:00Z","timestamp":1352160000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s00037-012-0050-8","type":"journal-article","created":{"date-parts":[[2012,11,5]],"date-time":"2012-11-05T09:15:30Z","timestamp":1352106930000},"page":"85-98","source":"Crossref","is-referenced-by-count":2,"title":["ReachFewL = ReachUL"],"prefix":"10.1007","volume":"23","author":[{"given":"Brady","family":"Garvin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derrick","family":"Stolee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghunath","family":"Tewari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. V.","family":"Vinodchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,6]]},"reference":[{"issue":"2","key":"50_CR1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.tcs.2006.01.005","volume":"355","author":"Allender Eric","year":"2006","unstructured":"Eric Allender (2006) NL-printable sets and nondeterministic Kolmogorov complexity. Theoretical Computer Science 355(2): 127\u2013138","journal-title":"Theoretical Computer Science"},{"key":"50_CR2","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s002240000102","volume":"31","author":"Allender Eric","year":"1998","unstructured":"Eric Allender, Klaus-J\u00f6rn Lange (1998) RUSPACE(log n) $${\\subseteq}$$ DSPACE(log2 n\/ log log n). Theory of Computing Systems 31: 539\u2013550","journal-title":"Theory of Computing Systems"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Eric Allender, Klaus Reinhardt & Shiyu Zhou (1999). Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. Journal of Computer and System Sciences 59(2), 164\u2013181. ISSN 0022- 0000.","DOI":"10.1006\/jcss.1999.1646"},{"key":"50_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","volume":"107","author":"\u00c0lvarez Carme","year":"1993","unstructured":"Carme \u00c0lvarez, Birgit Jenner (1993) A very hard log-space counting class. Theoretical Computer Science 107: 3\u201330","journal-title":"Theoretical Computer Science"},{"key":"50_CR5","unstructured":"Sanjeev Arora & Boaz Barak (2009). Computational Complexity - A Modern Approach. Cambridge University Press. ISBN 978-0-521- 42426-4."},{"issue":"1","key":"50_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1490270.1490274","volume":"1","author":"Bourke Chris","year":"2009","unstructured":"Chris Bourke, Raghunath Tewari, Vinodchandran N. V. (2009) Directed Planar Reachability Is in Unambiguous Log-Space. ACM Transactions on Computation Theory 1(1): 1\u201317","journal-title":"ACM Transactions on Computation Theory"},{"issue":"3","key":"50_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01374526","volume":"25","author":"Buntrock Gerhard","year":"1992","unstructured":"Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel (1992) Structure and Importance of Logspace- MOD Class. Mathematical Systems Theory 25(3): 223\u2013237","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"50_CR8","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/inco.1993.1004","volume":"102","author":"Buntrock Gerhard","year":"1993","unstructured":"Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes (1993) Using Inductive Counting to Simulate Nondeterministic Computation. Information and Computation 102(1): 102\u2013117","journal-title":"Information and Computation"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Gerhard Buntrock, Birgit Jenner, Klaus-J\u00f6rn Lange & Peter Rossmanith (1991). Unambiguity and fewness for logarithmic space. In Proceedings of the 8th International Conference on Fundamentals of Computation Theory (FCT\u201991), Volume 529 Lecture Notes in Computer Science, 168\u2013179. Springer-Verlag.","DOI":"10.1007\/3-540-54458-5_61"},{"issue":"3","key":"50_CR10","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"Fredman Michael L.","year":"1984","unstructured":"Michael L. Fredman, J\u00e1nos Koml\u00f3s, Endre Szemer\u00e9di (1984) Storing a Sparse Table with O(1) Worst Case Access Time. Journal of the ACM 31(3): 538\u2013544","journal-title":"Journal of the ACM"},{"key":"50_CR11","unstructured":"Klaus-J\u00f6rn Lange (1997). An Unambiguous Class Possessing a Complete Set. In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS\u201997), 339\u2013350."},{"key":"50_CR12","unstructured":"A. Pavan, Raghunath Tewari & N. V. Vinodchandran (2010). On the Power of Unambiguity in Logspace To appear in Computational Complexity."},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"Klaus Reinhardt & Eric Allender (2000). Making nondeterminism unambiguous. SIAM Journal on Computing 29(4), 1118 \u2013 1131. ISSN 0097-5397.","DOI":"10.1137\/S0097539798339041"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Thomas Thierauf & Fabian Wagner (2009). Reachability in K 3,3- Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space. In Proceedings of the 26th International Conference on Fundamentals of Computation Theory (FCT\u201909), 323\u2013334.","DOI":"10.1007\/978-3-642-03409-1_29"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-012-0050-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-012-0050-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-012-0050-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T07:23:05Z","timestamp":1562311385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-012-0050-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,6]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s00037-012-0050-8","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,6]]}}}