{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T13:41:31Z","timestamp":1771854091339,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":10152,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/s0019-9958(85)80026-7","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T07:12:14Z","timestamp":1115104334000},"page":"53-69","source":"Crossref","is-referenced-by-count":11,"title":["Uniform characterizations of non-uniform complexity measures"],"prefix":"10.1016","volume":"67","author":[{"given":"Jos\u00e9 L.","family":"Balc\u00e1zar","sequence":"first","affiliation":[]},{"given":"Josep","family":"D\u00edaz","sequence":"additional","affiliation":[]},{"given":"Joaquim","family":"Gabarr\u00f3","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(85)80026-7_bib1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00289267","article-title":"The equivalence of Horn and network complexity for boolean functions","volume":"15","author":"Aanderaa","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/S0019-9958(85)80026-7_bib2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(85)80026-7_bib3","series-title":"15 ACM Symps. Theory of Comput.","first-page":"87","article-title":"Bounds for width two branching programs","author":"Borodin","year":"1983"},{"key":"10.1016\/S0019-9958(85)80026-7_bib4","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"key":"10.1016\/S0019-9958(85)80026-7_bib5","series-title":"3rd GI Conf. Theoret. Comput. Sci.","first-page":"132","article-title":"On one-way auxiliary pushdown automata","volume":"Vol. 48","author":"Brandenburg","year":"1977"},{"key":"10.1016\/S0019-9958(85)80026-7_bib6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(81)90044-X","article-title":"Concise description of finite languages","volume":"14","author":"Bucher","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(85)80026-7_bib7","series-title":"Almost context-free languages","author":"Chytil","year":"1984"},{"key":"10.1016\/S0019-9958(85)80026-7_bib8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","article-title":"Characterizations of pushdown machines in terms of time-bounded computers","volume":"18","author":"Cook","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(85)80026-7_bib9","series-title":"Internat. Colloq. in Automata Lang., and Programming, 83","first-page":"226","article-title":"Funciones de Complejidad y Su Relacion con las Familias Abstractas de Lenguajes","author":"Gabarr\u00f3","year":"1983"},{"key":"10.1016\/S0019-9958(85)80026-7_bib10","series-title":"Conf. on Theoret. Comput. Sci.","article-title":"Straight line programs to compute finite languages","author":"Goodrich","year":"1977"},{"key":"10.1016\/S0019-9958(85)80026-7_bib11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0304-3975(76)90072-4","article-title":"Remarks on the complexity of nondeterministic counter languages","volume":"1","author":"Greibach","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(85)80026-7_bib12","first-page":"31","article-title":"Classification of computations by time and memory requirements","volume":"65","author":"Hartmanis","year":"1965"},{"key":"10.1016\/S0019-9958(85)80026-7_bib13","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","article-title":"Some results on tape-bounded Turing machines","volume":"3","author":"Hopcroft","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(85)80026-7_bib14","series-title":"Formal Languages and their relation to automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0019-9958(85)80026-7_bib15","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0019-9958(85)80026-7_bib16","series-title":"ACM Sympos. Theory of Comput. '80","first-page":"309","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/S0019-9958(85)80026-7_bib17","first-page":"120","article-title":"A method of circuit synthesis","volume":"1","author":"Lupanov","year":"1958","journal-title":"Izv. Vyssh. Uchebn. Zaved. Radiofiz."},{"key":"10.1016\/S0019-9958(85)80026-7_bib18","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/322033.322037","article-title":"Log space recognition and translation of parenthesis languages","volume":"24","author":"Lynch","year":"1977","journal-title":"Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(85)80026-7_bib19","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/S0019-9958(85)80026-7_bib20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(85)90217-8","article-title":"The recursion-theoretic structure of complexity classes","volume":"38","author":"Schmidt","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(85)80026-7_bib21","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(84)90058-6","article-title":"On small generators","volume":"34","author":"Sch\u00f6ning","year":"1984","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T14:55:35Z","timestamp":1548514535000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995885800267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["S0019995885800267"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(85)80026-7","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}