{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:19:39Z","timestamp":1725560379951},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_35","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"399-409","source":"Crossref","is-referenced-by-count":3,"title":["Canonical Disjoint NP-Pairs of Propositional Proof Systems"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[]},{"given":"Alan L.","family":"Selman","sequence":"additional","affiliation":[]},{"given":"Liyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"S. Cook","year":"1979","unstructured":"Cook, S., Reckhow, R.: The relative efficiency of propositional proof systems. Journal of Symbolic Logic\u00a044, 36\u201350 (1979)","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"35_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/0217018","volume":"17","author":"J. Grollmann","year":"1988","unstructured":"Grollmann, J., Selman, A.: Complexity measures for public-key cryptosystems. SIAM Journal on Computing\u00a017(2), 309\u2013335 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"35_CR3","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., Sengupta, S., Zhang, L.: Disjoint NP-pairs. SIAM Journal on Computing\u00a033(6), 1369\u20131416 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"35_CR4","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.: 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"},{"key":"35_CR5","volume-title":"Texts in Computer Science","author":"S. Homer","year":"2001","unstructured":"Homer, S., Selman, A.: Computability and Complexity Theory. In: Texts in Computer Science, Springer, New York (2001)"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R. Ladner","year":"1975","unstructured":"Ladner, R.: On the structure of polynomial-time reducibility. Journal of the ACM\u00a022, 155\u2013171 (1975)","journal-title":"Journal of the ACM"},{"key":"35_CR7","unstructured":"Messner, J.: On the Simulation Order of Proof Systems. PhD thesis, Universit\u00e4t Ulm (2000)"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/3-540-45687-2_48","volume-title":"Proceedings 27rd Mathematical Foundations of Computer Science","author":"J. Messner","year":"2002","unstructured":"Messner, J.: On the structure of the simulation order of proof systems. In: Proceedings 27rd Mathematical Foundations of Computer Science. LNCS, vol.\u00a01450, pp. 581\u2013592. Springer, Heidelberg (2002)"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/3-540-44683-4_54","volume-title":"Mathematical Foundations of Computer Science 2001","author":"P. Pudl\u00e1k","year":"2001","unstructured":"Pudl\u00e1k, P.: On reducibility and symmetry of disjoint NP-pairs. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 621\u2013632. Springer, Heidelberg (2001)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Razborov, A.: On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Colloquium on Computational Complexity (1994)","DOI":"10.7146\/brics.v1i36.21607"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-12689-9_119","volume-title":"Foundations of Computation Theory","author":"K. Regan","year":"1983","unstructured":"Regan, K.: On diagonalization methods and the structure of language classes. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 368\u2013380. Springer, Heidelberg (1983)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0022-0000(88)90036-0","volume":"36","author":"K. Regan","year":"1988","unstructured":"Regan, K.: The topology of provability in complexity theory. Journal of Computer and System Sciences\u00a036, 384\u2013432 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(82)90114-1","volume":"18","author":"U. Sch\u00f6ning","year":"1982","unstructured":"Sch\u00f6ning, U.: A uniform approach to obtain diagonal sets in complexity classes. Theoretical Computer Science\u00a018, 95\u2013103 (1982)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:41:16Z","timestamp":1605642076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11549345_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}