{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:08:45Z","timestamp":1648724925398},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,2,1]],"date-time":"1987-02-01T00:00:00Z","timestamp":539136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1987,2]]},"DOI":"10.1016\/0020-0190(87)90181-5","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"171-176","source":"Crossref","is-referenced-by-count":9,"title":["On solving hard problems by polynomial-size circuits"],"prefix":"10.1016","volume":"24","author":[{"given":"Dung T.","family":"Huynh","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90181-5_BIB1","series-title":"Proc. 19th FOCS","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0020-0190(87)90181-5_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","article-title":"Bi-immune sets for complexity classes","volume":"18","author":"Balcazar","year":"1985","journal-title":"Math. Systems Theor."},{"key":"10.1016\/0020-0190(87)90181-5_BIB3","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\/0020-0190(87)90181-5_BIB4","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\/0020-0190(87)90181-5_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. ACM"},{"key":"10.1016\/0020-0190(87)90181-5_BIB6","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1090\/S0002-9904-1940-07154-X","article-title":"On the concept of random sequence","volume":"46","author":"Church","year":"1940","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(87)90181-5_BIB7","series-title":"The existence and density of generalized complexity cores","author":"Du","year":"1984"},{"key":"10.1016\/0020-0190(87)90181-5_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/2455.214111","article-title":"Hard core theorem for complexity classes","volume":"32","author":"Even","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(87)90181-5_BIB9","series-title":"Proc. 24th FOCS","first-page":"439","article-title":"Generalized Kolmogorov complexity and the structure of feasible computations","author":"Hartmanis","year":"1983"},{"key":"10.1016\/0020-0190(87)90181-5_BIB10","series-title":"Exponentially dense complexity cores for provably intractable problems","author":"Huynh","year":"1984"},{"key":"10.1016\/0020-0190(87)90181-5_BIB11","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\/0020-0190(87)90181-5_BIB12","series-title":"Proc. Conf. on Structures 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\/0020-0190(87)90181-5_BIB13","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 and Control"},{"key":"10.1016\/0020-0190(87)90181-5_BIB14","series-title":"Proc. 12th STOC","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/0020-0190(87)90181-5_BIB15","unstructured":"K. Ko, Resource-bounded program-size complexity and pseudo-random sequences, Unpublished manuscript."},{"key":"10.1016\/0020-0190(87)90181-5_BIB16","first-page":"1","article-title":"Three approaches for defining the concept of information quantity","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Probab. Inform. Trans."},{"key":"10.1016\/0020-0190(87)90181-5_BIB17","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321892.321895","article-title":"On reducibility to complex or sparse sets","volume":"22","author":"Lynch","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(87)90181-5_BIB18","series-title":"Proc. MFCS \/84","first-page":"452","article-title":"On the density of polynomial complexity cores","volume":"Vol. 176","author":"Orponen","year":"1984"},{"key":"10.1016\/0020-0190(87)90181-5_BIB19","series-title":"Proc. 15th STOC","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/0020-0190(87)90181-5_BIB20","series-title":"Proc. 24th FOCS","first-page":"335","article-title":"Randomness and the density of hard problems","author":"Wilber","year":"1983"},{"key":"10.1016\/0020-0190(87)90181-5_BIB21","series-title":"Proc. 24th FOCS","first-page":"329","article-title":"Relativized circuit complexity","author":"Wilson","year":"1983"},{"key":"10.1016\/0020-0190(87)90181-5_BIB22","series-title":"Proc. 23rd FOCS","first-page":"80","article-title":"Theory and applications of trapdoor functions","author":"Yao","year":"1982"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901815?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901815?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:52:16Z","timestamp":1553593936000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087901815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["0020019087901815"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90181-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}