乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:29:04Z","timestamp":1648700944536},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"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":7990,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/0885-064x(91)90038-y","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T18:41:18Z","timestamp":1094668878000},"page":"296-310","source":"Crossref","is-referenced-by-count":5,"title":["Random languages for nonuniform complexity classes"],"prefix":"10.1016","volume":"7","author":[{"given":"Martin","family":"Mundhenk","sequence":"first","affiliation":[]},{"given":"Rainer","family":"Schuler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(91)90038-Y_BIB1","series-title":"Structural Complexity 1","author":"Balc\u00e1zar","year":"1987"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(87)90111-3","article-title":"On characterizations of the class PSPACE\/poly","volume":"52","author":"Balc\u00e1zar","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0885-064X(91)90038-Y_BIB3","series-title":"Proceedings of 23rd IEEE Symposium on Foundations of Computer Science","first-page":"112","article-title":"How to generate cryptographically strong sequences of pseudo random bits","author":"Blum","year":"1982"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB4","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\/0885-064X(91)90038-Y_BIB5","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1090\/S0002-9904-1940-07154-X","article-title":"On the concept of a random sequence","volume":"46","author":"Church","year":"1940","journal-title":"Bull. Amer. Soc."},{"key":"10.1016\/0885-064X(91)90038-Y_BIB6","series-title":"Proceedings of the 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\/0885-064X(91)90038-Y_BIB7","series-title":"Proceedings of the 6th Annual IEEE Symposium on Switching Circuits Theory and Logicals Design","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Hartmanis","year":"1965"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB8","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":"SIAMJ. Comput."},{"key":"10.1016\/0885-064X(91)90038-Y_BIB9","series-title":"Proceedings of the 1st Conference on Structure in Complexity Theory","first-page":"184","article-title":"Resource-bounded complexity of hard languages","author":"Huynh","year":"1986"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(87)90181-5","article-title":"On solving hard problems by polynomial-size circuits","volume":"24","author":"Huynh","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0885-064X(91)90038-Y_BIB11","series-title":"Proceedings of the 12th Annual ACM Symposium on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB12","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB13","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1137\/1132060","article-title":"Algorithms and randomness","volume":"32","author":"Kolmogorov","year":"1987","journal-title":"Probab. Appl."},{"key":"10.1016\/0885-064X(91)90038-Y_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\/0885-064X(91)90038-Y_BIB15","series-title":"Proceedings of the 3rd Conference on Structure in Complexity Theory, IEEE","first-page":"80","article-title":"Two decades of applied Kolmogorov complexity","author":"Li","year":"1988"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB16","series-title":"Proceedings of the 3rd Conference on Structure in Complexity Theory, IEEE","first-page":"175","article-title":"Pseudorandom sources for BPP","author":"Lutz","year":"1988"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB17","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"On the definition or random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB18","series-title":"Theory of Machines and Computations","first-page":"19","article-title":"Computationally complex and pseudorandom zero-one valued functions","author":"Meyer","year":"1971"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB19","article-title":"Complexity and structureo","volume":"Vol. 211","author":"Sch\u00f6ning","year":"1986"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB20_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inferences","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB20_2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A formal theory of inductive inferences","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB21","series-title":"Proceedings of the 24th IEEE Symposium on Foundations of Computer Science","first-page":"335","article-title":"Randomness and the density of hard problems","author":"Wilber","year":"1983"},{"key":"10.1016\/0885-064X(91)90038-Y_BIB22","series-title":"Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science","first-page":"80","article-title":"Theory and application of trapdoor functions","author":"Yao","year":"1982"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9190038Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9190038Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T01:57:39Z","timestamp":1549245459000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X9190038Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["0885064X9190038Y"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(91)90038-y","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}