{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:47:31Z","timestamp":1648838851578},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":6225,"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":[[1996,7]]},"DOI":"10.1016\/0304-3975(95)00097-6","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"123-140","source":"Crossref","is-referenced-by-count":20,"title":["On resource-bounded instance complexity"],"prefix":"10.1016","volume":"161","author":[{"given":"Lance","family":"Fortnow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kummer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00097-6_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0890-5401(88)90044-2","article-title":"Polynomial terse sets","volume":"70","author":"Amir","year":"1988","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00097-6_BIB2","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0304-3975(95)00097-6_BIB3","series-title":"Structural Complexity II","author":"Balc\u00e1zar","year":"1990"},{"key":"10.1016\/0304-3975(95)00097-6_BIB4","series-title":"Proc. Structure in Complexity Theory, 9th Annual Conf.","first-page":"217","article-title":"Random strings make hard instances","author":"Buhrman","year":"1994"},{"key":"10.1016\/0304-3975(95)00097-6_BIB5","series-title":"Complexity Theory","first-page":"227","article-title":"Promises and fault-tolerant database access","author":"Cai","year":"1993"},{"key":"10.1016\/0304-3975(95)00097-6_BIB6","series-title":"Proc. 24th IEEE Symp. Foundations of Computer Science","first-page":"439","article-title":"Generalized Kolmogorov complexity and the structure of feasible computation","author":"Hartmanis","year":"1983"},{"key":"10.1016\/0304-3975(95)00097-6_BIB7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(83)90024-8","article-title":"On sparse sets in NP-P","volume":"16","author":"Hartmanis","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00097-6_BIB8","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/S0022-0000(05)80006-6","article-title":"On reductions of NP sets to sparse sets","volume":"48","author":"Homer","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00097-6_BIB9","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(95)00097-6_BIB10","series-title":"Proc. Structure in Complexity Theory, 7th Annual Conf.","first-page":"327","article-title":"A note on the instance complexity of pseudorandom sets","author":"Ko","year":"1992"},{"key":"10.1016\/0304-3975(95)00097-6_BIB11","series-title":"Structure in Complexity Theory","first-page":"197","article-title":"What is a hard instance of a computational problem?","author":"Ko","year":"1986"},{"key":"10.1016\/0304-3975(95)00097-6_BIB12","doi-asserted-by":"crossref","unstructured":"M. Kummer, Kolmogorov complexity and instance complexity of recursively enumerable sets, SIAM J. Comput., to appear.","DOI":"10.1137\/S0097539794268789"},{"key":"10.1016\/0304-3975(95)00097-6_BIB13","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"key":"10.1016\/0304-3975(95)00097-6_BIB14","series-title":"On symmetry of information and polynomial time invertibility","author":"Longpr\u00e9","year":"1993"},{"key":"10.1016\/0304-3975(95)00097-6_BIB15","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","article-title":"Almost every set in exponential time is p-bi-immune","volume":"136","author":"Mayordomo","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00097-6_BIB16","series-title":"Proc. Structure in Complexity Theory, 8th Annual Conf.","first-page":"52","article-title":"P-selective sets, and reducing search to decision vs. self-reducibility","author":"Naik","year":"1993"},{"key":"10.1016\/0304-3975(95)00097-6_BIB17","series-title":"Proc. Structure in Complexity Theory, 5th Annual Conf.","first-page":"20","article-title":"On the instance complexity of NP-hard problems","author":"Orponen","year":"1990"},{"key":"10.1016\/0304-3975(95)00097-6_BIB18","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/174644.174648","article-title":"Instance complexity","volume":"41","author":"Orponen","year":"1994","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(95)00097-6_BIB19","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/0304-3975(95)00097-6_BIB20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00097-6_BIB21","series-title":"Proc. 15th ACM Symp. Theory of Computing","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/0304-3975(95)00097-6_BIB22","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(85)90218-X","article-title":"On one-one polynomial time equivalence relations","volume":"38","author":"Watanabe","year":"1985","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000976?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000976?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:24:22Z","timestamp":1556508262000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0304397595000976"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00097-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}