{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:30Z","timestamp":1725490050864},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_31","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"307-317","source":"Crossref","is-referenced-by-count":0,"title":["The Informational Content of Canonical Disjoint NP-Pairs"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan L.","family":"Selman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liyu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/11750321_23","volume-title":"Theory and Applications of Models of Computation","author":"O. Beyersdorff","year":"2006","unstructured":"Beyersdorff, O.: Disjoint NP-pairs from propositional proof systems. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 236\u2013247. Springer, Heidelberg (2006)"},{"issue":"1","key":"31_CR2","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":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1137\/S009753970444421X","volume":"36","author":"C. Gla\u00dfer","year":"2006","unstructured":"Gla\u00dfer, C., Pavan, A., Selman, A.L., Sengupta, S.: Properties of NP-complete sets. SIAM Journal on Computing\u00a036(2), 516\u2013542 (2006)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1137\/S0097539703425848","volume":"33","author":"C. Gla\u00dfer","year":"2004","unstructured":"Gla\u00dfer, C., Selman, A.L., Sengupta, S., Zhang, L.: Disjoint NP-pairs. SIAM Journal on Computing\u00a033(6), 1369\u20131416 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_22","volume-title":"STACS 2007","author":"C. Gla\u00dfer","year":"2007","unstructured":"Gla\u00dfer, C., Selman, A.L., Travers, S., Wagner, K.W.: The complexity of unions of disjoint sets. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, Springer, Heidelberg (2007)"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11685654_11","volume-title":"Theoretical Computer Science","author":"C. Gla\u00dfer","year":"2006","unstructured":"Gla\u00dfer, C., Selman, A.L., Zhang, L.: Survey of disjoint NP-pairs and relations to propositional proof systems. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol.\u00a03895, Springer, Heidelberg (2006)"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2006.10.006","volume":"370","author":"C. Gla\u00dfer","year":"2007","unstructured":"Gla\u00dfer, C., Selman, A.L., Zhang, L.: Canonical disjoint NP-pairs of propositional proof systems. Theoretical Computer Science\u00a0370, 60\u201373 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/0217018","volume":"17","author":"J. Grollmann","year":"1988","unstructured":"Grollmann, J., Selman, A.L.: Complexity measures for public-key cryptosystems. SIAM Journal on Computing\u00a017(2), 309\u2013335 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0022-0000(92)90023-C","volume":"44","author":"S. Homer","year":"1992","unstructured":"Homer, S., Selman, A.L.: Oracles for structural properties: The isomorphism problem and public-key cryptography. Journal of Computer and System Sciences\u00a044(2), 287\u2013301 (1992)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0890-5401(03)00058-0","volume":"184","author":"J. K\u00f6bler","year":"2003","unstructured":"K\u00f6bler, J., Messner, J., Tor\u00e1n, J.: Optimal proof systems imply complete sets for promise classes. Information and Computation\u00a0184(1), 71\u201392 (2003)","journal-title":"Information and Computation"},{"unstructured":"Me\u00dfner, J.: On the Simulation order of proof systems. PhD thesis, Universit\u00e4t Ulm, Abteilung Theoretische Informatik (December 2000)","key":"31_CR11"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(02)00411-5","volume":"295","author":"P. Pudl\u00e1k","year":"2003","unstructured":"Pudl\u00e1k, P.: On reducibility and symmetry of disjoint NP-pairs. Theoretical Computer Science\u00a0295, 323\u2013339 (2003)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Razborov, A.A.: On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Computational Complexity Colloquium (1994)","key":"31_CR13","DOI":"10.7146\/brics.v1i36.21607"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:17:53Z","timestamp":1619518673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}