{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T17:10:23Z","timestamp":1740244223402,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_10","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"102-113","source":"Crossref","is-referenced-by-count":3,"title":["Mean-Payoff Games and Propositional Proofs"],"prefix":"10.1007","author":[{"given":"Albert","family":"Atserias","sequence":"first","affiliation":[]},{"given":"Elitza","family":"Maneva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M., Razborov, A.A.: Resolution is not automatizable unless W[P] is tractable. In: 42nd IEEE Symp. Found. of Comp. Sci., pp. 210\u2013219 (2001)","DOI":"10.1109\/SFCS.2001.959895"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.ic.2003.10.004","volume":"189","author":"A. Atserias","year":"2004","unstructured":"Atserias, A., Bonet, M.L.: On the automatizability of resolution and related propositional proof systems. Information and Computation\u00a0189(2), 182\u2013201 (2004)","journal-title":"Information and Computation"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-48224-5_81","volume-title":"Automata, Languages and Programming","author":"A. Atserias","year":"2001","unstructured":"Atserias, A., Bonet, M.L., Esteban, J.L.: Lower bounds for the weak pigeonhole principle and random formulas beyond resolution. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 136\u2013152. Springer, Heidelberg (2001)"},{"key":"10_CR4","unstructured":"Atserias, A., Maneva, E.: Mean payoff-games and the max-atom problem. Technical report (2009), http:\/\/www.lsi.upc.edu\/~atserias"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Beame, P., Pitassi, T.: Simplified and improved resolution lower bounds. In: 37th IEEE Symp. Found of Comp. Sci., pp. 274\u2013282 (1996)","DOI":"10.1109\/SFCS.1996.548486"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/375827.375835","volume":"48","author":"E. Ben-Sasson","year":"2001","unstructured":"Ben-Sasson, E., Wigderson, A.: Short proofs are narrow\u2013resolution made simple. J. ACM\u00a048(2), 149\u2013169 (2001); Prelim. version in STOC 1999","journal-title":"J. ACM"},{"key":"10_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-89439-1_4","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Bezem","year":"2008","unstructured":"Bezem, M., Nieuwenhuis, R., Rodr\u00edguez-Carbonell, E.: The max-atom problem and its relevance. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 47\u201361. Springer, Heidelberg (2008)"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.tcs.2005.07.041","volume":"349","author":"H. Bj\u00f6rklund","year":"2005","unstructured":"Bj\u00f6rklund, H., Vorobyov, S.: Combinatorial structure and randomized subexponential algorithms for infinite games. Theor. Comp. Sci.\u00a0349(3), 347\u2013360 (2005)","journal-title":"Theor. Comp. Sci."},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"708","DOI":"10.2307\/2275569","volume":"62","author":"M. Bonet","year":"1997","unstructured":"Bonet, M., Pitassi, T., Raz, R.: Lower bounds for cutting planes proofs with small coefficients. J. Symb. Logic\u00a062(3), 708\u2013728 (1997); Prelim. version in STOC 1995","journal-title":"J. Symb. Logic"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00037-004-0183-5","volume":"13","author":"M.L. Bonet","year":"2004","unstructured":"Bonet, M.L., Domingo, C., Gavald\u00e0, R., Maciel, A., Pitassi, T.: Non-automatizability of bounded-depth Frege proofs. Computational Complexity\u00a013, 47\u201368 (2004); Prelim. version in CCC 1999","journal-title":"Computational Complexity"},{"issue":"6","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1137\/S0097539798353230","volume":"29","author":"M.L. Bonet","year":"2000","unstructured":"Bonet, M.L., Pitassi, T., Raz, R.: On interpolation and automatization for Frege systems. SIAM J. Comp.\u00a029(6), 1939\u20131967 (2000); Prelim. version in FOCS 1997","journal-title":"SIAM J. Comp."},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielsky, J.: Positional strategies for mean payoff games. International Journal of Game Theory\u00a08(2), 109\u2013113 (1979)","journal-title":"International Journal of Game Theory"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M. Furst","year":"1984","unstructured":"Furst, M., Saxe, J., Sipser, M.: Parity, circuits and the polynomial time hierarchy. Mathematical Systems Theory\u00a017, 13\u201327 (1984)","journal-title":"Mathematical Systems Theory"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M. Jurdzi\u0144ski","year":"1998","unstructured":"Jurdzi\u0144ski, M.: Deciding the winner in parity games is in UP \u2229 co-UP. Information Processing Letters\u00a068, 119\u2013124 (1998)","journal-title":"Information Processing Letters"},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1137\/070686652","volume":"38","author":"M. Jurdzi\u0144ski","year":"2008","unstructured":"Jurdzi\u0144ski, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. SIAM J. Comp.\u00a038(4), 1519\u20131532 (2008)","journal-title":"SIAM J. Comp."},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R.M. Karp","year":"1978","unstructured":"Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Mathematics\u00a023(3), 309\u2013311 (1978)","journal-title":"Discrete Mathematics"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2307\/2275541","volume":"62","author":"J. Kraj\u00edcek","year":"1997","unstructured":"Kraj\u00edcek, J.: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symb. Logic\u00a062, 457\u2013486 (1997)","journal-title":"J. Symb. Logic"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/inco.1997.2674","volume":"140","author":"J. Kraj\u00edcek","year":"1998","unstructured":"Kraj\u00edcek, J., Pudl\u00e1k, P.: Some consequences of cryptographical conjectures for $S^1_2$ and EF. Information and Computation\u00a0140(1), 82\u201394 (1998)","journal-title":"Information and Computation"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. AMS Chelsea Publ. (2009)","DOI":"10.1090\/chel\/367"},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/S009753970037727X","volume":"33","author":"R.H. M\u00f6hring","year":"2004","unstructured":"M\u00f6hring, R.H., Skutella, M., Stork, F.: Scheduling with AND\/OR Precedence Constraints. SIAM J. Comp.\u00a033(2), 393\u2013415 (2004)","journal-title":"SIAM J. Comp."},{"key":"10_CR21","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1995)"},{"key":"10_CR22","unstructured":"Pitassi, T., Santhanam, R.: Effectively polynomial simulations. In: Proceedings of First Symposium on Innovations in Computer Science, ICS (2010)"},{"issue":"3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"P. Pudl\u00e1k","year":"1997","unstructured":"Pudl\u00e1k, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symb. Logic\u00a062(3), 981\u2013998 (1997)","journal-title":"J. Symb. Logic"},{"key":"10_CR24","first-page":"197","volume-title":"Sets and Proofs, Invited Papers from Logic Colloq. 1997","author":"P. Pudl\u00e1k","year":"1999","unstructured":"Pudl\u00e1k, P.: On the complexity of the propositional calculus. In: Sets and Proofs, Invited Papers from Logic Colloq. 1997, pp. 197\u2013218. Cambridge Univ. Press, Cambridge (1999)"},{"key":"10_CR25","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. Theor. Comp. Sci.\u00a0295, 323\u2013339 (2003)","journal-title":"Theor. Comp. Sci."},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Pudl\u00e1k, P., Sgall, J.: Algebraic models of computation and interpolation for algebraic proof systems. In: Proof Complexity and Feasible Arithmetic. AMS (1998)","DOI":"10.1090\/dimacs\/039\/15"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comp. Sci.\u00a0158, 343\u2013359 (1996)","journal-title":"Theor. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:31:16Z","timestamp":1740241876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}