{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T23:33:13Z","timestamp":1768260793904,"version":"3.49.0"},"reference-count":47,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0022-0000(92)90020-j","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"220-258","source":"Crossref","is-referenced-by-count":198,"title":["Almost everywhere high nonuniform complexity"],"prefix":"10.1016","volume":"44","author":[{"given":"Jack H.","family":"Lutz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90020-J_BIB1","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\/0022-0000(92)90020-J_BIB2","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0890-5401(90)90052-J","article-title":"Kolmogorov complexity and degrees of tally sets","volume":"86","author":"Allender","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/0022-0000(92)90020-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\/0022-0000(92)90020-J_BIB4","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0022-0000(92)90020-J_BIB5","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","article-title":"How to generate cryptographically strong sequences of pseudo-random bits","volume":"13","author":"Blum","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90020-J_BIB6","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","article-title":"On the length of programs for computing finite binary sequences","volume":"13","author":"Chaitin","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90020-J_BIB7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01084088","article-title":"Families of recursive predicates of measure zero","volume":"6","author":"Freidzon","year":"1976","journal-title":"J. Soviet Math."},{"key":"10.1016\/0022-0000(92)90020-J_BIB8","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","article-title":"How to construct random functions","volume":"33","author":"Goldreich","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90020-J_BIB9","series-title":"Measure Theory","author":"Halmos","year":"1950"},{"key":"10.1016\/0022-0000(92)90020-J_BIB10","series-title":"Proceedings, 24th IEEE Symposium on the 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\/0022-0000(92)90020-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\/0022-0000(92)90020-J_BIB12","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1137\/0215079","article-title":"Some observations about the randomness of hard problems","volume":"15","author":"Huynh","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90020-J_BIB13","series-title":"Structure in Complexity Theory","first-page":"184","article-title":"Resource-bounded Kolmogorov complexity of hard languages","volume":"Vol. 223","author":"Huynh","year":"1986"},{"key":"10.1016\/0022-0000(92)90020-J_BIB14","doi-asserted-by":"crossref","unstructured":"D. W. Juedes and J. H. Lutz, Kolmogorov complexity, complexity cores, and the distribution of hardness, in \u201cKolmogorov Complexity: Theory and Relations to Computational Complexity\u201d (O. Watanabe, Ed.), Springer-Verlag, New York, to appear.","DOI":"10.1007\/978-3-642-77735-6_4"},{"key":"10.1016\/0022-0000(92)90020-J_BIB15","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0019-9958(82)90382-5","article-title":"Circuit-size lower bounds and non-reducibility to sparse sets","volume":"55","author":"Kannan","year":"1982","journal-title":"Inform. Control"},{"key":"10.1016\/0022-0000(92)90020-J_BIB16","series-title":"Proceedings, 12th ACM Symposium on the Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/0022-0000(92)90020-J_BIB17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0304-3975(86)90081-2","article-title":"On the notion of infinite pseudorandom sequences","volume":"48","author":"Ko","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90020-J_BIB18","first-page":"1","article-title":"Three approaches to the quantitative definition of \u201cinformation,\u201d","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Probl. Inform. Trans."},{"key":"10.1016\/0022-0000(92)90020-J_BIB19","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1137\/1132060","article-title":"Algorithms and randomness","volume":"32","author":"Kolmogorov","year":"1987","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/0022-0000(92)90020-J_BIB20","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02579323","article-title":"One way functions and pseudorandom generators","volume":"7","author":"Levin","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0022-0000(92)90020-J_BIB21","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-444-88071-0.50009-6","article-title":"Kolmogorov Complexity and its Applications","author":"Li","year":"1990"},{"key":"10.1016\/0022-0000(92)90020-J_BIB22","article-title":"Resource Bounded Kolmogorov Complexity, a Link between Computational Complexity and Information Theory","author":"Longpr\u00e9","year":"1986"},{"key":"10.1016\/0022-0000(92)90020-J_BIB23","first-page":"23","article-title":"On the synthesis of contact networks","volume":"19","author":"Lupanov","year":"1958","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0022-0000(92)90020-J_BIB24","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/0219076","article-title":"Category and measure in complexity classes","volume":"19","author":"Lutz","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90020-J_BIB25","doi-asserted-by":"crossref","first-page":"30b","DOI":"10.1016\/0022-0000(90)90023-E","article-title":"Pseudorandom sources for BPP","volume":"41","author":"Lutz","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90020-J_BIB26","unstructured":"J. H. LUTZ, Resource-bounded measure, in preparation."},{"key":"10.1016\/0022-0000(92)90020-J_BIB27","unstructured":"J. H. LUTZ, Intrinsically pseudorandom sequences, in preparation."},{"key":"10.1016\/0022-0000(92)90020-J_BIB28","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"On the definition of random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Inform. Control"},{"key":"10.1016\/0022-0000(92)90020-J_BIB29","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00534110","article-title":"Complexity oscillations in infinite binary sequences","volume":"19","author":"Martin-L\u00f6f","year":"1971","journal-title":"Z. Wahrscheinlichkeitstheorie Verw. Geb."},{"key":"10.1016\/0022-0000(92)90020-J_BIB30","series-title":"Proceedings, 14th IEEE Symposium on the Foundations of Computer Science","first-page":"190","article-title":"On the size of sets of computable functions","author":"Mehlhorn","year":"1973"},{"key":"10.1016\/0022-0000(92)90020-J_BIB31","series-title":"Springer Lecture Notes","first-page":"317","article-title":"The \u201calmost all\u201d theory of subrecursive degrees is decidable","author":"Mehlhorn","year":"1974"},{"key":"10.1016\/0022-0000(92)90020-J_BIB32","series-title":"Theory of Machines and Computations","article-title":"Computationally complex and pseudorandom zero-one valued functions","author":"Meyer","year":"1971"},{"key":"10.1016\/0022-0000(92)90020-J_BIB33","series-title":"Measure and Category","author":"Oxtoby","year":"1980"},{"key":"10.1016\/0022-0000(92)90020-J_BIB34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00538763","article-title":"Klassifikation der Zufallsgesetze nach Komplexit\u00e4t and Ordnung","volume":"16","author":"Schnorr","year":"1970","journal-title":"Z. Wahrscheinlichkeitstheorie Verw. Geb."},{"key":"10.1016\/0022-0000(92)90020-J_BIB35","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/BF01694181","article-title":"A unified approach to the definition of random sequences","volume":"5","author":"Schnorr","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(92)90020-J_BIB36","article-title":"Zufdlligkeit and Wahrscheinlichkeit","volume":"Vol. 218","author":"Schnorr","year":"1971"},{"key":"10.1016\/0022-0000(92)90020-J_BIB37","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","article-title":"Process complexity and effective random tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90020-J_BIB38","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","article-title":"The synthesis of two-terminal switching circuits","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0022-0000(92)90020-J_BIB39","series-title":"Proceedings, 15th ACM Symposium on the Theory of Computing","first-page":"330","article-title":"A complexity-theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/0022-0000(92)90020-J_BIB40_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. Control"},{"key":"10.1016\/0022-0000(92)90020-J_BIB40_2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. Control"},{"key":"10.1016\/0022-0000(92)90020-J_BIB41","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1070\/RM1990v045n01ABEH002321","article-title":"Can an individual sequence of zeros and ones be random?","volume":"45","author":"Uspenskii","year":"1990","journal-title":"Russ. Math. Surveys"},{"key":"10.1016\/0022-0000(92)90020-J_BIB42","article-title":"Random Sequences","author":"Van Lambalgen","year":"1987"},{"key":"10.1016\/0022-0000(92)90020-J_BIB43","series-title":"Proceedings, 24th IEEE Symposium on the Foundations of Computer Science","first-page":"335","article-title":"Randomness and the density of hard problems","author":"Wilber","year":"1983"},{"key":"10.1016\/0022-0000(92)90020-J_BIB44","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0022-0000(85)90040-6","article-title":"Relativized circuit complexity","volume":"31","author":"Wilson","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90020-J_BIB45","series-title":"Proceedings, 23rd IEEE Symposium on Foundations of Computer Science","first-page":"80","article-title":"Theory and applications of trapdoor functions","author":"Yao","year":"1982"},{"key":"10.1016\/0022-0000(92)90020-J_BIB46","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/TIT.1986.1057209","article-title":"The complexity of information extraction","volume":"IT-32","author":"Abu-Mostafa","year":"1986","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290020J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290020J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:57:00Z","timestamp":1550307420000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290020J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002200009290020J"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90020-j","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}