{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:57:01Z","timestamp":1725530221495},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642009815"},{"type":"electronic","value":"9783642009822"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00982-2_14","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T15:51:54Z","timestamp":1238428314000},"page":"164-175","source":"Crossref","is-referenced-by-count":5,"title":["Nondeterministic Instance Complexity and Proof Systems with Advice"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Beyersdorff","sequence":"first","affiliation":[]},{"given":"Johannes","family":"K\u00f6bler","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.2178\/jsl\/1203350791","volume":"72","author":"S.A. Cook","year":"2007","unstructured":"Cook, S.A., Kraj\u00ed\u010dek, J.: Consequences of the provability of \n                    \n                      \n                    \n                    $\\mathit{NP} \\subseteq P\/\\mathit{poly}$\n                  . The Journal of Symbolic Logic\u00a072(4), 1353\u20131371 (2007)","journal-title":"The Journal of Symbolic Logic"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-87531-4_16","volume-title":"Computer Science Logic","author":"O. Beyersdorff","year":"2008","unstructured":"Beyersdorff, O., M\u00fcller, S.: A tight Karp-Lipton collapse result in bounded arithmetic. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 199\u2013214. Springer, Heidelberg (2008)"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/174644.174648","volume":"41","author":"P. Orponen","year":"1994","unstructured":"Orponen, P., Ko, K., Sch\u00f6ning, U., Watanabe, O.: Instance complexity. Journal of the ACM\u00a041(1), 96\u2013121 (1994)","journal-title":"Journal of the ACM"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/3-540-46541-3_26","volume-title":"STACS 2000","author":"V. Arvind","year":"2000","unstructured":"Arvind, V., K\u00f6bler, J., Mundhenk, M., Tor\u00e1n, J.: Nondeterministic instance complexity and hard-to-prove tautologies. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 314\u2013323. Springer, Heidelberg (2000)"},{"key":"14_CR5","first-page":"302","volume-title":"Proc. 12th ACM Symposium on Theory of Computing","author":"R.M. Karp","year":"1980","unstructured":"Karp, R.M., Lipton, R.J.: Some connections between nonuniform and uniform complexity classes. In: Proc. 12th ACM Symposium on Theory of Computing, pp. 302\u2013309. ACM Press, New York (1980)"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"S.A. Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. The Journal of Symbolic Logic\u00a044(1), 36\u201350 (1979)","journal-title":"The Journal of Symbolic Logic"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.2307\/2274765","volume":"54","author":"J. Kraj\u00ed\u010dek","year":"1989","unstructured":"Kraj\u00ed\u010dek, J., Pudl\u00e1k, P.: Propositional proof systems, the consistency of first order theories and the complexity of computations. The Journal of Symbolic Logic\u00a054(3), 1063\u20131079 (1989)","journal-title":"The Journal of Symbolic Logic"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1137\/S009753979834388X","volume":"31","author":"H. Buhrman","year":"2001","unstructured":"Buhrman, H., Fortnow, L., Laplante, S.: Resource-bounded Kolmogorov complexity revisited. SIAM Journal on Computing\u00a031(3), 887\u2013905 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/3-540-36494-3_48","volume-title":"STACS 2003","author":"H. Buhrman","year":"2003","unstructured":"Buhrman, H., Chang, R., Fortnow, L.: One bit of advice. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 547\u2013558. Springer, Heidelberg (2003)"},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2005.01.002","volume":"198","author":"J.Y. Cai","year":"2005","unstructured":"Cai, J.Y., Chakaravarthy, V.T., Hemaspaandra, L.A., Ogihara, M.: Competing provers yield improved Karp-Lipton collapse results. Information and Computation\u00a0198(1), 1\u201323 (2005)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00982-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T02:28:26Z","timestamp":1551925706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}