{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:18:22Z","timestamp":1648973902542},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6529,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0304-3975(95)00033-s","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:19:56Z","timestamp":1027613996000},"page":"183-205","source":"Crossref","is-referenced-by-count":0,"title":["On adaptive DLOGTIME and POLYLOGTIME reductions"],"prefix":"10.1016","volume":"148","author":[{"given":"Carme","family":"\u00c0lvarez","sequence":"first","affiliation":[]},{"given":"Birgit","family":"Jenner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00033-S_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u03a311 formulae on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(95)00033-S_BIB2","article-title":"Parallel time and sequential reducibilities","author":"\u00c0lvarez","year":"1994"},{"key":"10.1016\/0304-3975(95)00033-S_BIB3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01191473","article-title":"Adaptive logspace reducibility and parallel time","volume":"28","author":"\u00c0lvarez","year":"1995","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00033-S_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","article-title":"A very hard log-space counting class","volume":"107","author":"\u00c0lvarez","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00033-S_BIB5","series-title":"Proc. 11th STACS","first-page":"301","article-title":"On adaptive dlogtime and polylogtime reductions","volume":"Vol. 775","author":"\u00c0lvarez","year":"1994"},{"key":"10.1016\/0304-3975(95)00033-S_BIB6","series-title":"Proc. 6th Structure in Complexity Theory Conference, IEEE","first-page":"240","article-title":"Adaptive logspace and depth-bounded reducibilities","author":"Balc\u00e1zar","year":"1991"},{"key":"10.1016\/0304-3975(95)00033-S_BIB7","series-title":"Computer Science","first-page":"351","article-title":"The complexity of algorithmic problems on succinct instances","author":"Balc\u00e1zar","year":"1992"},{"issue":"3","key":"10.1016\/0304-3975(95)00033-S_BIB8","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/0304-3975(95)00033-S_BIB9","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1137\/0218038","article-title":"Two applications of inductive counting for complementation problems","volume":"18","author":"Borodin","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00033-S_BIB10","series-title":"Proc. 19th ACM STOC Symp.","first-page":"123","article-title":"The formula value problem is in ALOGTIME","author":"Buss","year":"1987"},{"issue":"4","key":"10.1016\/0304-3975(95)00033-S_BIB11","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1137\/0221046","article-title":"An optimal parallel algorithm for formula evaluation","volume":"21","author":"Buss","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00033-S_BIB12","series-title":"Proc. 9th STACS","first-page":"305","article-title":"Characterizations of some complexity classes between \u03982p and \u03942p","volume":"Vol. 577","author":"Castro","year":"1992"},{"key":"10.1016\/0304-3975(95)00033-S_BIB13","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00033-S_BIB14","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00033-S_BIB15","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems, with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00033-S_BIB16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits, and the polynomial-time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00033-S_BIB17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(94)00080-3","article-title":"Parallel queries to NP","volume":"141","author":"Jenner","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00033-S_BIB18","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log space complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0304-3975(95)00033-S_BIB19","series-title":"Proc. 20th IEEE FOCS","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979"},{"key":"10.1016\/0304-3975(95)00033-S_BIB20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00033-S_BIB21","series-title":"Proc. 15th ACM STOC Symp.","first-page":"61","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983"},{"key":"10.1016\/0304-3975(95)00033-S_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00033-S_BIB23","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","article-title":"On the tape complexity of deterministic context-free languages","volume":"25","author":"Sudborough","year":"1978","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/0304-3975(95)00033-S_BIB24","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1137\/0219058","article-title":"Bounded query classes","volume":"19","author":"Wagner","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00033-S_BIB25","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01692056","article-title":"Relativized NC","volume":"20","author":"Wilson","year":"1987","journal-title":"Math. Systems Theory"},{"issue":"2","key":"10.1016\/0304-3975(95)00033-S_BIB26","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1137\/0219024","article-title":"Decomposing NC and AC","volume":"19","author":"Wilson","year":"1990","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500033S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500033S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T05:26:45Z","timestamp":1556256405000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500033S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["030439759500033S"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00033-s","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}