{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:00Z","timestamp":1725488520771},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_26","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"314-323","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Nondeterministic Instance Complexity and Hard-to-Prove Tautologies"],"prefix":"10.1007","author":[{"given":"Vikraman","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"K\u00f6bler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Mundhenk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacobo","family":"Tor\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"J. L. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3, Structural Complexity I, EATCS Monographs on Theoretical Computer Science. Springer-Verlag, second edition, 1995.","DOI":"10.1007\/978-3-642-79235-9"},{"key":"26_CR2","unstructured":"P. Beame and T. Pitassi, Propositional proof complexity: past, present, and future, ECCC Report TR98-067, 1998."},{"key":"26_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BFb0023452","volume-title":"Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science","author":"H. Buhrman","year":"1997","unstructured":"H. Buhrman and L. Fortnow, Resource-bounded Kolmogorov complexity revisited, In Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science, LNCS, 1200: 105\u2013116, Springer, 1997."},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"S. A. Cook","year":"1979","unstructured":"S. A. Cook and R. A. Reckhow, The relative efficiency of propositional proof systems, Journal of Symbolic Logic, 44(1):36\u201350, 1979.","journal-title":"Journal of Symbolic Logic"},{"key":"26_CR5","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 A, 161:123\u2013140, 1996.","journal-title":"Theoretical Computer Science A"},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/0022-0000(89)90024-X","volume":"39","author":"J. Kadin","year":"1989","unstructured":"J. Kadin, PNP[log n]and sparse Turing-complete sets for NP, Journal of Computer and System Sciences, 39(3):282\u2013298, 1989.","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR7","doi-asserted-by":"publisher","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 ACM, 41:96\u2013121, 1994.","journal-title":"Journal of the ACM"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"J. Kraj\u00edcek, Bounded arithmetic, propositional logic, and complexity theory, Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511529948"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"M. Li and P. Vitanyi, Kolmogorov complexity and applications, Springer Verlag, 1993.","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"26_CR10","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"},{"key":"26_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/BFb0029986","volume-title":"Proc. MFCS","author":"M. Mundhenk","year":"1997","unstructured":"M. Mundhenk, NP-hard sets have many hard instances, In Proc. MFCS, LNCS 1295, 428\u2013437, Springer Verlag, 1997."},{"key":"26_CR12","unstructured":"S. Riis and M. Sitharam, Generating hard tautologies using predicate logic and the symmetric group, BRICS Report RS-98-19."},{"key":"26_CR13","series-title":"Lect Notes Comput Sci","first-page":"273","volume-title":"Proc. CSL","author":"U. Sch\u00f6ning","year":"1987","unstructured":"U. Sch\u00f6ning, Complexity cores and hard to prove formulas, In Proc. CSL, LNCS, Springer Verlag, 273\u2013280, 1987."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"M. Sipser, A complexity theoretic approach to randomness, In Proc. ACM STOC, 330\u2013335, 1983.","DOI":"10.1145\/800061.808762"}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:49:03Z","timestamp":1558273743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_26","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"}}]}}