Mean-payoff games and propositional proofs
- 1 April 2011
- journal article
- Published by Elsevier BV in Information and Computation
- Vol. 209 (4), 664-691
- https://doi.org/10.1016/j.ic.2011.01.003
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Combinatorial structure and randomized subexponential algorithms for infinite gamesTheoretical Computer Science, 2005
- Non-Automatizability of Bounded-Depth Frege Proofscomputational complexity, 2004
- On the automatizability of resolution and related propositional proof systemsInformation and Computation, 2004
- Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond ResolutionInformation and Computation, 2002
- Short proofs are narrow—resolution made simpleJournal of the ACM, 2001
- On Interpolation and Automatization for Frege SystemsSIAM Journal on Computing, 2000
- Deciding the winner in parity games is in UP ∩ co-UPInformation Processing Letters, 1998
- Lower bounds for cutting planes proofs with small coefficientsThe Journal of Symbolic Logic, 1997
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- Positional strategies for mean payoff gamesInternational Journal of Game Theory, 1979