Mean-payoff games and propositional proofs

DOI10.1007/978-3-642-14165-2_10zbMATH Open1287.03101OpenAlexW2164528091MaRDI QIDQ3587372FDOQ3587372

Authors Albert Atserias, Elitza Maneva

Publication date 7 September 2010

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.2527

Mathematics Subject Classification ID

Games involving graphs (91A43) Complexity of proofs (03F20)

Recommendations

• Mean-payoff games and propositional proofs
• Parity Games and Propositional Proofs
• Parity Games and Propositional Proofs
• The complexity of mean payoff games on graphs
• Potential theory for mean payoff games

Cited in

(5)

• MAX-closed semilinear constraint satisfaction
• Automatizability and simple stochastic games
• Conceptual proofs of the Menger and Rothberger games
• Mean-payoff games and propositional proofs
• scientific article; zbMATH DE number 6130976 (Why is no real title available?)

This page was built for publication: Mean-payoff games and propositional proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587372)