{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:00Z","timestamp":1750694700405,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135613"},{"type":"electronic","value":"9783642135620"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13562-0_4","type":"book-chapter","created":{"date-parts":[[2010,5,31]],"date-time":"2010-05-31T09:08:30Z","timestamp":1275296910000},"page":"28-39","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Acceptors and Optimal Proof Systems"],"prefix":"10.1007","author":[{"given":"Edward A.","family":"Hirsch","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0206023","volume":"6","author":"L. Berman","year":"1977","unstructured":"Berman, L., Hartmanis, J.: On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing\u00a06(2), 305\u2013322 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"38-40","key":"4_CR2","doi-asserted-by":"publisher","first-page":"3839","DOI":"10.1016\/j.tcs.2009.05.021","volume":"410","author":"O. Beyersdorff","year":"2009","unstructured":"Beyersdorff, O., K\u00f6bler, J., Messner, J.: Nondeterministic functions and the existence of optimal proof systems. Theor. Comput. Sci.\u00a0410(38-40), 3839\u20133855 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-00982-2_14","volume-title":"Language and Automata Theory and Applications","author":"O. Beyersdorff","year":"2009","unstructured":"Beyersdorff, O., K\u00f6bler, J., M\u00fcller, S.: Nondeterministic instance complexity and proof systems with advice. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 164\u2013175. Springer, Heidelberg (2009)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-642-03351-3_7","volume-title":"CSR 2009","author":"O. Beyersdorff","year":"2009","unstructured":"Beyersdorff, O., Sadowski, Z.: Characterizing the existence of optimal proof systems and complete sets for promise classes. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol.\u00a05675, pp. 47\u201358. Springer, Heidelberg (2009)"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000004","volume":"2","author":"A. Bogdanov","year":"2006","unstructured":"Bogdanov, A., Trevisan, L.: Average-case complexity. Foundation and Trends in Theoretical Computer Science\u00a02(1), 1\u2013106 (2006)","journal-title":"Foundation and Trends in Theoretical Computer Science"},{"issue":"4","key":"4_CR6","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 NP\u2009\u2286\u2009P\/poly. The Journal of Symbolic Logic\u00a072(4), 1353\u20131371 (2007)","journal-title":"The Journal of Symbolic Logic"},{"issue":"1","key":"4_CR7","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"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Fortnow, L., Santhanam, R.: Hierarchy theorems for probabilistic polynomial time. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 316\u2013324 (2004)","DOI":"10.1109\/FOCS.2004.33"},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1165555.1165565","volume":"37","author":"L. Fortnow","year":"2006","unstructured":"Fortnow, L., Santhanam, R.: Recent work on hierarchies for semantic classes. SIGACT News\u00a037(3), 36\u201354 (2006)","journal-title":"SIGACT News"},{"key":"4_CR10","unstructured":"Hirsch, E.A., Itsykson, D.: On optimal heuristic randomized semidecision procedures, with application to proof complexity. In: Proceedings of STACS 2010, pp. 453\u2013464 (2010)"},{"key":"4_CR11","unstructured":"Hirsch, E.A., Itsykson, D., Smal, A.: Optimal heuristic randomized acceptors and automatizable proof systems (March 2010) (unpublished manuscript)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-642-03351-3_16","volume-title":"CSR 2009","author":"D.M. Itsykson","year":"2009","unstructured":"Itsykson, D.M.: Structural complexity of AvgBPP. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol.\u00a05675, pp. 155\u2013166. Springer, Heidelberg (2009)"},{"issue":"1","key":"4_CR13","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. Inf. Comput.\u00a0184(1), 71\u201392 (2003)","journal-title":"Inf. Comput."},{"issue":"3","key":"4_CR14","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"},{"key":"4_CR15","unstructured":"Levin, L.A.: Universal sequential search problems. Problems of Information Transmission\u00a09, 265\u2013266 (1973) (in Russian); English translation in: Trakhtenbrot, B.A.: A Survey of Russian Approaches to Perebor (Brute-force Search) Algorithms. Annals of the History of Computing\u00a06(4), 384\u2013400 (1984)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/3-540-49116-3_51","volume-title":"STACS 99","author":"J. Messner","year":"1999","unstructured":"Messner, J.: On optimal algorithms and optimal proof systems. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 361\u2013372. Springer, Heidelberg (1999)"},{"key":"4_CR17","unstructured":"Monroe, H.: Speedup for natural problems and coNP?=NP. Technical Report 09-056, Electronic Colloquium on Computational Complexity (2009)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Pervyshev, K.: On heuristic time hierarchies. In: Proceedings of the 22nd IEEE Conference on Computational Complexity, pp. 347\u2013358 (2007)","DOI":"10.1109\/CCC.2007.20"},{"key":"4_CR19","unstructured":"Pitassi, T., Santhanam, R.: Effectively polynomial simulations. In: Proceedings of ICS 2010 (2010)"},{"issue":"1-3","key":"4_CR20","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(1-3), 323\u2013339 (2003)","journal-title":"Theoretical Computer Science"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Razborov, A.A.: On provably disjoint NP-pairs. Technical Report 94-006, Electronic Colloquium on Computational Complexity (1994)","DOI":"10.7146\/brics.v1i36.21607"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BFb0036203","volume-title":"Fundamentals of Computation Theory","author":"Z. Sadowski","year":"1997","unstructured":"Sadowski, Z.: On an optimal quantified propositional proof system and a complete language for NP\u2229co-NP. In: Chlebus, B.S., Czaja, L. (eds.) FCT 1997. LNCS, vol.\u00a01279, pp. 423\u2013428. Springer, Heidelberg (1997)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/10703163_13","volume-title":"Computer Science Logic","author":"Z. Sadowski","year":"1999","unstructured":"Sadowski, Z.: On an optimal deterministic algorithm for SAT. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol.\u00a01584, pp. 179\u2013187. Springer, Heidelberg (1999)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Sadowski, Z.: Optimal proof systems, optimal acceptors and recursive representability. Fundamenta Informaticae, 169\u2013185 (2007)","DOI":"10.3233\/FUN-2007-791-208"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13562-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:20:39Z","timestamp":1740136839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13562-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135613","9783642135620"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13562-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}