{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:51Z","timestamp":1725456351694},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029986","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"428-437","source":"Crossref","is-referenced-by-count":2,"title":["NP-hard sets have many hard instances"],"prefix":"10.1007","author":[{"given":"Martin","family":"Mundhenk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"V. Arvind, J. K\u00f6bler, and M. Mundhenk. On bounded truth-table, conjunctive, and randomized reductions to sparse sets. In Proceedings 12th Conference on the Foundations of Software Technology & Theoretical Computer Science, pages 140\u2013151. Lecture Notes in Computer Science #652, Springer-Verlag, 1992.","DOI":"10.1007\/3-540-56287-7_101"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"J.L. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3. Structural Complexity I\/II. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1988\/1990.","DOI":"10.1007\/978-3-642-75357-2"},{"issue":"2","key":"43_CR3","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1137\/0222029","volume":"22","author":"R. Book","year":"1993","unstructured":"R. Book and J. Lutz. On languages with very high space-bounded Kolmogorov complexity. SIAM Journal on Computing, 22(2):395\u2013402, 1993.","journal-title":"SIAM Journal on Computing"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"H. Buhrman and P. Orponen. Random strings make hard instances. In Proc. 9th Structure in Complexity Theory Conference, pages 217\u2013222. IEEE, 1994.","DOI":"10.1109\/SCT.1994.315802"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"L. Fortnow and M. Kummer. Resource-bounded instance complexity. In Proceedings of 12th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science #900, Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_108"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"J. Hartmanis. Generalized Kolmogorov complexity and the structure of feasible computations. In Proc. 24th IEEE Symp. on Foundations of Computer Science, pages 439\u2013445, 1983.","DOI":"10.1109\/SFCS.1983.21"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"R. Karp and R. Lipton. Some relations between nonuniform and uniform complexity classes. In Prooceedings of the 12th ACM Symposium on Theory of Computing, pages 302\u2013309, April 1980.","DOI":"10.1145\/800141.804678"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"K. Ko. A note on the instance complexity of pseudorandom sets. In Proc. 7th Structure in Complexity Theory Conference, pages 327\u2013337. IEEE, 1992.","DOI":"10.1109\/SCT.1992.215407"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/174644.174648","volume":"41","author":"K. Ko","year":"1994","unstructured":"K. Ko, P. Orponen, U. Sch\u00f6ning, and O. Watanabe. Instance complexity. Journal of the ACM, 41:96\u2013121, 1994.","journal-title":"Journal of the ACM"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"M. Kummer. The instance complexity conjecture. In Proc. 10th Structure in Complexity Theory Conference, pages 111\u2013124. IEEE, 1995.","DOI":"10.1109\/SCT.1995.514733"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"M. Li and P. Vit\u00e1nyi. An introduction to Kolmogorou complexity and its applications. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/321892.321895","volume":"22","author":"N. Lynch","year":"1975","unstructured":"N. Lynch. On reducibility to complex or sparse sets. Journal of the ACM, 22:341\u2013345, 1975.","journal-title":"Journal of the ACM"},{"issue":"2","key":"43_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","volume":"25","author":"S. Mahaney","year":"1982","unstructured":"S. Mahaney. Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis. Journal of Computer and System Sciences, 25(2):130\u2013143, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"P. Orponen and U. Sch\u00f6ning. The structure of polynomial complexity cores. In 11th Symp. on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science #176, Springer-Verlag, 1984.","DOI":"10.1007\/BFb0030328"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"O. Watanabe. Polynomial time reducibility to a set of small density. In Proc. 1987 Structure in Complexity Theory Conference, pages 138\u2013146. Lecture Notes in Computer Science #223, Springer-Verlag, 1987.","DOI":"10.1109\/PSCT.1987.10319263"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T06:58:04Z","timestamp":1706770684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029986"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0029986","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}