The Descriptive Complexity of Parity Games

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-87531-4_26
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Timed Parity Games: Complexity and Robustness

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Mean-Payoff Parity Games

English

On Promptness in Parity Games*†

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2015English

Algorithms for Stochastic Parity Games

2005English

Descriptive and Computational Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1989English

Parity Games of Bounded Tree- And Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Perfect-Information Stochastic Mean-Payoff Parity Games

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Complexity of Egalitarian Mechanisms for Linear Programming Games

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2014English

A Descriptive Study of Recreation and Games of the Bodo Society.

International Journal of Advanced Research
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy