{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:29:36Z","timestamp":1736400576907,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341666"},{"type":"electronic","value":"9783540341680"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_11","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T20:17:13Z","timestamp":1146169033000},"page":"80-91","source":"Crossref","is-referenced-by-count":0,"title":["Tuples of Disjoint NP-Sets"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Beyersdorff","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Beyersdorff, O.: Representable disjoint NP-pairs. In: Proc. 24th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 122\u2013134 (2004)","key":"11_CR1","DOI":"10.1007\/978-3-540-30538-5_11"},{"unstructured":"Beyersdorff, O.: Tuples of disjoint NP-sets. Technical Report TR05-123, Electronic Colloquium on Computational Complexity (2005)","key":"11_CR2"},{"doi-asserted-by":"crossref","unstructured":"Beyersdorff, O.: Disjoint NP-pairs from propositional proof systems. In: Proc. 3rd Conference on Theory and Applications of Models of Computation (2006)","key":"11_CR3","DOI":"10.1007\/11750321_23"},{"key":"11_CR4","volume-title":"Bounded Arithmetic","author":"S.R. Buss","year":"1986","unstructured":"Buss, S.R.: Bounded Arithmetic. Bibliopolis, Napoli (1986)"},{"key":"11_CR5","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, 36\u201350 (1979)","journal-title":"The Journal of Symbolic Logic"},{"doi-asserted-by":"crossref","unstructured":"Gla\u00dfer, C., Selman, A.L., Sengupta, S.: Reductions between disjoint NP-pairs. In: Proc. 19th Annual IEEE Conference on Computational Complexity, pp. 42\u201353 (2004)","key":"11_CR6","DOI":"10.1109\/CCC.2004.1313791"},{"issue":"6","key":"11_CR7","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"},{"doi-asserted-by":"crossref","unstructured":"Gla\u00dfer, C., Selman, A.L., Zhang, L.: Survey of disjoint NP-pairs and relations to propositional proof systems. Technical Report TR05-072, Electronic Colloquium on Computational Complexity (2005)","key":"11_CR8","DOI":"10.1007\/11549345_35"},{"issue":"2","key":"11_CR9","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"},{"key":"11_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, 71\u201392 (2003)","journal-title":"Information and Computation"},{"key":"11_CR11","series-title":"Encyclopedia of Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Encyclopedia of Mathematics and Its Applications, vol.\u00a060. Cambridge University Press, Cambridge (1995)"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2307\/2275541","volume":"62","author":"J. Kraj\u00ed\u010dek","year":"1997","unstructured":"Kraj\u00ed\u010dek, J.: Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic. The Journal of Symbolic Logic\u00a062(2), 457\u2013486 (1997)","journal-title":"The Journal of Symbolic Logic"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.2178\/jsl\/1080938841","volume":"69","author":"J. Kraj\u00ed\u010dek","year":"2004","unstructured":"Kraj\u00ed\u010dek, J.: Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds. The Journal of Symbolic Logic\u00a069(1), 265\u2013286 (2004)","journal-title":"The Journal of Symbolic Logic"},{"doi-asserted-by":"crossref","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, 1963\u20131079 (1989)","key":"11_CR14","DOI":"10.2307\/2274765"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/malq.19900360106","volume":"36","author":"J. Kraj\u00ed\u010dek","year":"1990","unstructured":"Kraj\u00ed\u010dek, J., Pudl\u00e1k, P.: Quantified propositional calculi and fragments of bounded arithmetic. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik\u00a036, 29\u201346 (1990)","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"doi-asserted-by":"crossref","unstructured":"Kraj\u00ed\u010dek, J., Pudl\u00e1k, P.: Some consequences of cryptographical conjectures for $S^{1\\over2}$ and EF. Information and Computation\u00a0140(1), 82\u201394 (1998)","key":"11_CR16","DOI":"10.1006\/inco.1997.2674"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R.E. Ladner","year":"1975","unstructured":"Ladner, R.E.: On the structure of polynomial-time reducibility. Journal of the ACM\u00a022, 155\u2013171 (1975)","journal-title":"Journal of the ACM"},{"key":"11_CR18","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 Colloquium on Computational Complexity (1994)","key":"11_CR19","DOI":"10.7146\/brics.v1i36.21607"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T18:16:04Z","timestamp":1736360164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11753728_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}