{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:46:48Z","timestamp":1649004408641},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"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":[[1991,4]]},"DOI":"10.1016\/0304-3975(91)90320-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"127-135","source":"Crossref","is-referenced-by-count":9,"title":["An upward measure separation theorem"],"prefix":"10.1016","volume":"81","author":[{"given":"Jack H.","family":"Lutz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90320-2_BIB1","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978","journal-title":"Proc. 19th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90320-2_BIB2","volume":"I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0304-3975(91)90320-2_BIB3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracleA, PA \u2260 NPA \u2260 co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90320-2_BIB4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(74)80008-5","article-title":"Comparing complexity classes","volume":"9","author":"Book","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90320-2_BIB5","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\/0304-3975(91)90320-2_BIB6","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/0304-3975(91)90320-2_BIB7","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0304-3975(91)90320-2_BIB8","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\/0304-3975(91)90320-2_BIB9","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90320-2_BIB10","series-title":"Measure Theory","author":"Halmos","year":"1950"},{"key":"10.1016\/0304-3975(91)90320-2_BIB11","first-page":"439","article-title":"Generalized Kolmogorov complexity and the structure of feasible computations","author":"Hartmanis","year":"1983","journal-title":"Proc. 24th IEEE Symp. on the Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90320-2_BIB12","series-title":"Structure in Complexity Theory","first-page":"184","article-title":"Resource-bounded Kolmogorov complexity of hard languages","author":"Huynh","year":"1986"},{"key":"10.1016\/0304-3975(91)90320-2_BIB13","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\/0304-3975(91)90320-2_BIB14","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\/0304-3975(91)90320-2_BIB15","first-page":"1","article-title":"Three approaches to the quantitative definition of \u201cinformation\u201d","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0304-3975(91)90320-2_BIB16","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\/0304-3975(91)90320-2_BIB17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0019-9958(84)80060-1","article-title":"Randomness conservation inequalities; information and independence in mathematical theories","volume":"61","author":"Levin","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90320-2_BIB18","series-title":"Ph.D. Thesis","article-title":"Resource bounded Kolmogorov complexity, a link between computational complexity and information theory","author":"Longpr\u00e9","year":"1986"},{"key":"10.1016\/0304-3975(91)90320-2_BIB19","series-title":"Technical Report 88-8","article-title":"An elementary combinatorial derivation of \u201cthe\u201d Chernoff bound","author":"Lutz","year":"1988"},{"key":"10.1016\/0304-3975(91)90320-2_BIB20_1","doi-asserted-by":"crossref","unstructured":"J.H. Lutz, Almost everywhere high nonuniform complexity, J. Comput. System Sci. to appear.","DOI":"10.1109\/SCT.1989.41813"},{"key":"10.1016\/0304-3975(91)90320-2_BIB20_2","first-page":"81","article-title":"Almost everywhere high nonuniform complexity","author":"Lutz","year":"1989","journal-title":"Proc. 4th Structure in Complexity Theory Conf."},{"key":"10.1016\/0304-3975(91)90320-2_BIB21","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 Journal on Computing"},{"key":"10.1016\/0304-3975(91)90320-2_BIB22","first-page":"80","article-title":"Two decades of applied Kolmogorov complexity: In memorian Andrei Nikolaevich Kolmogorov 1903\u20131987","author":"Li","year":"1988","journal-title":"Proc. 3rd Structure in Complexity Theory Conf."},{"key":"10.1016\/0304-3975(91)90320-2_BIB23","first-page":"317","article-title":"The \u201calmost all\u201d theory of subrecursive degrees is decidable","author":"Mehlhorn","year":"1974","journal-title":"Proc. 2nd Coll. on Automata, Languages, and Programming"},{"key":"10.1016\/0304-3975(91)90320-2_BIB24","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/SFCS.1988.21916","article-title":"Hardness vs. randomness","author":"Nisan","year":"1988","journal-title":"Proc. 29th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90320-2_BIB25","unstructured":"N. Nisan and A. Wigderson, Hardness vs. randomness, in preparation."},{"key":"10.1016\/0304-3975(91)90320-2_BIB26","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":"23","author":"Shannon","year":"1949","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0304-3975(91)90320-2_BIB27","first-page":"330","article-title":"A complexity-theoretic approach to randomness","author":"Sipser","year":"1983","journal-title":"Proc. 15th ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0304-3975(91)90320-2_BIB28_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. and Control"},{"key":"10.1016\/0304-3975(91)90320-2_BIB28_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. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591903202?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591903202?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:26:50Z","timestamp":1580902010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591903202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["0304397591903202"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90320-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}