{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:43Z","timestamp":1759639003652},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"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":[[1997,8]]},"DOI":"10.1016\/s0020-0190(97)00111-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"153-158","source":"Crossref","is-referenced-by-count":5,"title":["A characterization of the leaf language classes"],"prefix":"10.1016","volume":"63","author":[{"given":"Bernd","family":"Borchert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00111-7_BIB1","series-title":"Proc. 19th IEEE Symp. on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0019-9958(85)80020-6","article-title":"Sublattices of the polynomial time degrees","volume":"65","author":"Ambos-Spies","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB3","series-title":"Computation Theory and Logic","first-page":"1","article-title":"Minimal pairs for polynomial time reducibilities","volume":"Vol. 270","author":"Ambos-Spies","year":"1986"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(89)90066-2","article-title":"On the relative complexity of hard problems for complexity classes without complete problems","volume":"63","author":"Ambos-Spies","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00111-7_BIB5","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB6","series-title":"Proc. 9th IEEE Structure in Complexity Theory Conf.","first-page":"235","article-title":"Predicate classes and promise classes","author":"Borchert","year":"1994"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB7","article-title":"Predicate classes, promise classes and the acceptance power of regular languages","author":"Borchert","year":"1994"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB8_1","series-title":"Proc. 6th IEEE Structure in Complexity Theory Conf.","first-page":"102","article-title":"Complexity classes and sparse oracles","author":"Bovet","year":"1991"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB8_2","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1006\/jcss.1995.1030","volume":"50","author":"Bovet","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(97)00111-7_BIB9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(92)90125-Y","article-title":"A uniform approach to define complexity classes","volume":"104","author":"Bovet","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00111-7_BIB10","series-title":"Universal Algebra","author":"Gr\u00e4tzer","year":"1968"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(88)90022-9","article-title":"Complexity classes without machines: On complete languages for UP","volume":"58","author":"Hartmanis","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00111-7_BIB12","series-title":"Proc. 12th ICALP","first-page":"250","article-title":"On complete problems for NP \u2229 co-NP","volume":"Vol. 194","author":"Hartmanis","year":"1985"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB13","series-title":"Proc. 8th IEEE Structure in Complexity Theory Conf.","first-page":"200","article-title":"On the power of polynomial time bit-reductions","author":"Hertrampf","year":"1993"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB14","article-title":"On balanced vs. unbalanced computation trees","author":"Hertrampf","year":"1994","journal-title":"Universit\u00e4t W\u00fcrzburg, Tech. Rept. No. 82"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB15","series-title":"Proc. 9th IEEE Structure in Complexity Theory Conf.","first-page":"242","article-title":"Logspace and logtime leaf languages","author":"Jenner","year":"1994"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB16","series-title":"Proc. MFCS","first-page":"364","article-title":"Some connections between representability of complexity classes and the power of formal systems of reasoning","volume":"Vol. 176","author":"Kowalczyk","year":"1984"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB17","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial-time reducibilities","volume":"22","author":"Ladner","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB18","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0022-0000(90)90024-F","article-title":"On the theory of the PTIME degrees of the recursive sets","volume":"41","author":"Shinoda","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(97)00111-7_BIB20","article-title":"Complexity classes and relativizations","author":"Silvestri","year":"1992"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB21","series-title":"Proc. 9th ICALP","first-page":"523","article-title":"On relativization and the existence of complete sets","volume":"Vol. 140","author":"Sipser","year":"1982"},{"key":"10.1016\/S0020-0190(97)00111-7_BIB22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1070\/IM1994v042n02ABEH001537","article-title":"Relativizable and nonrelativizable theorems in the polynomial theory of algorithms","volume":"42","author":"Vereshchagin","year":"1994","journal-title":"Russian Academy of Sciences, Izvestiya, Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001117?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001117?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T10:54:49Z","timestamp":1556362489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0020019097001117"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00111-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}