{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:56:22Z","timestamp":1648918582776},"reference-count":25,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0020-0190(01)00296-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"321-325","source":"Crossref","is-referenced-by-count":1,"title":["For completeness, sublogarithmic space is no space"],"prefix":"10.1016","volume":"82","author":[{"given":"Manindra","family":"Agrawal","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00296-4_BIB001","series-title":"Proceedings of the Structure in Complexity Theory Conference","first-page":"338","article-title":"On the isomorphism problem for weak reducibilities","author":"Agrawal","year":"1994"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB002","series-title":"Proceedings of Annual ACM Symposium on the Theory of Computing","first-page":"730","article-title":"Reducing the complexity of reductions","author":"Agrawal","year":"1997"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB003","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1006\/jcss.1998.1583","article-title":"Reductions in circuit complexity: An isomorphism theorem and a gap theorem","volume":"57","author":"Agrawal","year":"1998","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0020-0190(01)00296-4_BIB004","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1142\/S0129054196000245","article-title":"The isomorphism conjecture for 2-DFA reductions","volume":"7","author":"Agrawal","year":"1996","journal-title":"Internat. J. on Foundations Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00296-4_BIB005","series-title":"Proceedings of the Symposium on Theoretical Aspects of Computer Science","article-title":"A first-order isomorphism theorem","author":"Allender","year":"1993"},{"issue":"6","key":"10.1016\/S0020-0190(01)00296-4_BIB006","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0022-0000(88)90033-5","article-title":"Isomorphisms and 1-L reductions","volume":"36","author":"Allender","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00296-4_BIB007","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321679.321691","article-title":"Computational complexity and the existence of complexity gaps","volume":"19","author":"Borodin","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB008","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0221044","article-title":"Complete problems and strong polynomial reducibilities","volume":"21","author":"Ganesan","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00296-4_BIB009","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1051\/ita\/1993270403491","article-title":"Sublogarithmic \u03c32-space is not closed under complement and other separation results","volume":"27","author":"Geffert","year":"1993","journal-title":"Theoret. Inform. Appl."},{"issue":"5","key":"10.1016\/S0020-0190(01)00296-4_BIB010","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1051\/ita\/1994280504651","article-title":"A hierarchy that does not collapse: alternations in low level space","volume":"28","author":"Geffert","year":"1994","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0020-0190(01)00296-4_BIB011","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(78)90018-X","article-title":"On log-tape isomorphisms of complete sets","volume":"7","author":"Hartmanis","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00296-4_BIB012","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","article-title":"Some results on tape-bounded computation","volume":"16","author":"Hopcroft","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB013","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB014","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1137\/0222011","article-title":"Aspace (o(loglogn)) is regular","volume":"22","author":"Iwama","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00296-4_BIB015","series-title":"Complexity Theory Retrospective","first-page":"108","article-title":"The structure of complete degrees","author":"Kurtz","year":"1988"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB016","series-title":"Proceedings of the Structure in Complexity Theory Conference","first-page":"64","article-title":"The complexity world below logarithmic space","author":"Li\u015bkiewicz","year":"1993"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB017","series-title":"Proceedings of the Symposium on Theoretical Aspects of Computer Science","first-page":"6","article-title":"Separating the lower levels of the sublogarithmic space hierarchy","author":"Li\u015bkiewicz","year":"1993"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB018","series-title":"The sublogarithmic space world, Technical Report 048-93","author":"Li\u015bkiewicz","year":"1993"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB019","series-title":"Proceedings of the IEEE Conference on Switching Circuit Theory and Logical Design","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Stearns","year":"1965"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB020","series-title":"The complexity of decision problems in automata theory and logic, PhD Thesis","author":"Stockmeyer","year":"1974"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB021","series-title":"Proceedings of Annual IEEE Symposium on Foundations of Computer Science","first-page":"62","article-title":"Efficient algorithms for path system problems and applications to alternating and time-space complexity classes","author":"Sudborough","year":"1980"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB022","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(01)00296-4_BIB023","first-page":"33","article-title":"Turing computations with logarithmic delay","volume":"3","author":"Trakhtenbrot","year":"1964","journal-title":"Algebra i Logika"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB024","series-title":"Proceedings of the Symposium on Theoretical Aspects of Computer Science","first-page":"5","article-title":"Alternation for two-way machines with sublogarithmic space","author":"von Braunm\u00fchl","year":"1993"},{"key":"10.1016\/S0020-0190(01)00296-4_BIB025","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01271368","article-title":"The alternation hierarchy for sublogarithmic space is infinite","volume":"3","author":"von Braunm\u00fchl","year":"1993","journal-title":"Comput. Complexity"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002964?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002964?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:53:09Z","timestamp":1556650389000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0020019001002964"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00296-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}