{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:10:47Z","timestamp":1737349847211,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_27","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"324-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hard Instances of Hard Problems"],"prefix":"10.1007","author":[{"given":"Jack H.","family":"Lutz","sequence":"first","affiliation":[]},{"given":"Vikram","family":"Mhetre","sequence":"additional","affiliation":[]},{"given":"Sridhar","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Pure and Applied Mathematics","first-page":"1","volume-title":"Complexity, Logic and Recursion Theory","author":"K. Ambos-Spies","year":"1997","unstructured":"K. Ambos-Spies and E. Mayordomo. Resource-bounded measure and randomness. In A. Sorbi, editor, Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics, pages 1\u201347. Marcel Dekker, New York, N.Y., 1997."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0304-3975(95)00260-X","volume":"172","author":"K. Ambos-Spies","year":"1997","unstructured":"K. Ambos-Spies, S. A. Terwijn, and X. Zheng. Resource bounded randomness and weakly complete problems. Theoretical Computer Science, 172:195\u2013207, 1997.","journal-title":"Theoretical Computer Science"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1006\/jcss.1997.1484","volume":"54","author":"H. Buhrman","year":"1997","unstructured":"H. Buhrman and E. Mayordomo. An excursion to the Kolmogorov random strings. Journal of Computer and System Sciences, 54:393\u2013399, 1997.","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1006\/jcss.1996.0067","volume":"53","author":"H. Buhrman","year":"1996","unstructured":"H. Buhrman and P. Orponen. Random strings make hard instances. Journal of Computer and System Sciences, 53:261\u2013266, 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"H. Buhrman and L. Torenvliet. Complete sets and structure in subrecursive classes. In Proceedings of Logic Colloquium\u2019 96, pages 45\u201378. Springer-Verlag, 1998.","DOI":"10.1017\/9781316716816.003"},{"key":"27_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. M. Cover","year":"1991","unstructured":"T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., New York, N.Y., 1991."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(95)00097-6","volume":"161","author":"L. Fortnow","year":"1996","unstructured":"L. Fortnow and M. Kummer. On resource-bounded instance complexity. Theoretical Computer Science, 161:123\u2013140, 1996.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1137\/S0097539792238133","volume":"24","author":"D. W. Juedes","year":"1995","unstructured":"D. W. Juedes and J. H. Lutz. The complexity and distribution of hard problems. SIAM Journal on Computing, 24(2):279\u2013295, 1995.","journal-title":"SIAM Journal on Computing"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(95)80016-6","volume":"143","author":"D. W. Juedes","year":"1995","unstructured":"D. W. Juedes and J. H. Lutz. Weak completeness in E and E2. Theoretical Computer Science, 143:149\u2013158, 1995.","journal-title":"Theoretical Computer Science"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"K. Ko. A note on the instance complexity of pseudorandom sets. In Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pages 327\u2013337. IEEE Comput. Soc. Press, 1992.","DOI":"10.1109\/SCT.1992.215407"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Martin Kummer. On the complexity of random strings. In 13th Annual Symposium on Theoretical Aspects of Computer Science, pages 25\u201336. Springer, 1996.","DOI":"10.1007\/3-540-60922-9_3"},{"key":"27_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"M. Li","year":"1997","unstructured":"M. Li and P. M. B. Vit\u00e1nyi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, Berlin, 1997. Second Edition.","edition":"Second Edition"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","volume":"44","author":"J. H. Lutz","year":"1992","unstructured":"J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44:220\u2013258, 1992.","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"J. H. Lutz. The quantitative structure of exponential time. In L.A. Hemaspaandra and A.L. Selman, editors, Complexity Theory Retrospective II, pages 225\u2013254. Springer-Verlag, 1997.","DOI":"10.1007\/978-1-4612-1872-2_10"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"J. H. Lutz. Resource-bounded measure. In Proceedings of the 13th IEEE Conference on Computational Complexity, pages 236\u2013248, New York, 1998. IEEE.","DOI":"10.1109\/CCC.1998.694611"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(95)00189-1","volume":"164","author":"J. H. Lutz","year":"1996","unstructured":"J. H. Lutz and E. Mayordomo. Cook versus Karp-Levin: Separating completeness notions if NP is not small. Theoretical Computer Science, 164:141\u2013163, 1996.","journal-title":"Theoretical Computer Science"},{"key":"27_CR17","first-page":"64","volume":"68","author":"J. H. Lutz","year":"1999","unstructured":"J. H. Lutz and E. Mayordomo. Twelve problems in resource-bounded measure. Bulletin of the European Association for Theoretical Computer Science, 68:64\u201380, 1999.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","volume":"136","author":"E. Mayordomo","year":"1994","unstructured":"E. Mayordomo. Almost every set in exponential time is P-bi-immune. Theoretical Computer Science, 136(2):487\u2013506, 1994.","journal-title":"Theoretical Computer Science"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"M. Mundhenk. NP-hard sets have many hard instances. In Mathematical foundations of computer science 1997, pages 428\u2013437. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0029986"},{"key":"27_CR20","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/174644.174648","volume":"41","author":"P. Orponen","year":"1994","unstructured":"P. Orponen, K. Ko, U. Sch\u00f6ning, and O. Watanabe. Instance complexity. Journal of the Association of Computing Machinery, 41:96\u2013121, 1994.","journal-title":"Journal of the Association of Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:55:41Z","timestamp":1737341741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}