{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:46:43Z","timestamp":1787388403784,"version":"build-2736575974"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0890-5401(90)90052-j","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"160-178","source":"Crossref","is-referenced-by-count":17,"title":["Kolmogorov complexity and degrees of tally sets"],"prefix":"10.1016","volume":"86","author":[{"given":"Eric","family":"Allender","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Osamu","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90052-J_BIB1_1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0022-0000(89)90021-4","article-title":"Some consequences of the existence of pseudorandom generators","volume":"39","author":"Allender","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90052-J_BIB1_2","series-title":"Proceedings, 19th Annual ACM Symposium on Theory of Computing","first-page":"151","article-title":"Some consequences of the existence of pseudorandom generators","author":"Allender","year":"1987"},{"key":"10.1016\/0890-5401(90)90052-J_BIB2","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1137\/0217075","article-title":"P-printable sets","volume":"17","author":"Allender","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90052-J_BIB3","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/BF00264313","article-title":"Sets with small generalized Kolmogorov complexity","volume":"23","author":"Balc\u00e1zar","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0890-5401(90)90052-J_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","article-title":"Bi-immune sets for complexity classes","volume":"18","author":"Balc\u00e1zar","year":"1985","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(90)90052-J_BIB5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90052-J_BIB6","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1137\/0217056","article-title":"On sets truth-table reducible to sparse sets","volume":"17","author":"Book","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90052-J_BIB7","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1137\/0217078","article-title":"The Boolean hierarchy I: Structural properties","volume":"17","author":"Cai","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90052-J_BIB8","series-title":"Proceedings, 17th Annual ACM Symposium on Theory of Computing","first-page":"440","article-title":"Compression and ranking","author":"Goldberg","year":"1985"},{"key":"10.1016\/0890-5401(90)90052-J_BIB9","series-title":"Proceedings, 24th IEEE Symposium on Foundations of Computer Science","first-page":"439","article-title":"Generalized Kolmogorov complexity and the structure of feasible computations","author":"Hartmanis","year":"1983"},{"key":"10.1016\/0890-5401(90)90052-J_BIB10","series-title":"Proceedings, 3rd Annual Symposium on Theoretical Aspects of Computer Science","first-page":"321","article-title":"On sparse oracles separating feasible complexity classes","volume":"Vol. 210","author":"Hartmanis","year":"1986"},{"key":"10.1016\/0890-5401(90)90052-J_BIB11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(84)90111-7","article-title":"Computation times of NP sets of different densities","volume":"34","author":"Hartmanis","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90052-J_BIB12","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1145\/23005.23009","article-title":"Minimal degrees for polynomial reducibilities","volume":"34","author":"Homer","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90052-J_BIB13","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0890-5401(90)90052-J_BIB14","series-title":"Proceedings, 30th IEEE Symposium on Foundations of Computer Sciences","first-page":"222","article-title":"Decision versus search problems in super-polynomial time","author":"Impagliazzo","year":"1989"},{"key":"10.1016\/0890-5401(90)90052-J_BIB15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(85)90140-9","article-title":"Some remarks on witness functions for non-polynomial and non-complete sets in NP","volume":"39","author":"Joseph","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90052-J_BIB16","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/0885-064X(85)90012-3","article-title":"Continuous optimization problems and a polynomial hierarchy of real functions","volume":"1","author":"Ko","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0890-5401(90)90052-J_BIB17","series-title":"Proceedings, Structure in Complexity Theory, 3rd Annual Conference","first-page":"181","article-title":"Distinguishing bounded reducibilities by sparse sets","author":"Ko","year":"1988"},{"key":"10.1016\/0890-5401(90)90052-J_BIB18","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1137\/0218027","article-title":"Relativized polynomial time hierarchies extending exactly k levels","volume":"18","author":"Ko","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90052-J_BIB19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial-time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0890-5401(90)90052-J_BIB20","author":"Rogers","year":"1967"},{"key":"10.1016\/0890-5401(90)90052-J_BIB21","volume":"Vol. 211","author":"Sch\u00f6ning","year":"1985","journal-title":"\u201cComplexity and Structure,\u201d Lecture Notes in Computer Science"},{"key":"10.1016\/0890-5401(90)90052-J_BIB22","article-title":"A Study of the Structure of NP","author":"Sewelson","year":"1983"},{"key":"10.1016\/0890-5401(90)90052-J_BIB23","series-title":"Proceedings, 15th International Colloquium on Automata, Languages, and Programming","first-page":"591","article-title":"Separating polynomial-time Turing and truth-table degrees of tally sets","volume":"Vol. 317","author":"Tang","year":"1988"},{"key":"10.1016\/0890-5401(90)90052-J_BIB24","unstructured":"J. Comput. System Sci., to appear."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090052J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090052J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:56Z","timestamp":1548897956000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090052J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["089054019090052J"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90052-j","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}