800 search results - page 40 / 160 » On the Complexity of Parity Games |
FSTTCS
2004
Springer
14 years 2 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
HCI
2009
13 years 7 months ago
2009
Abstract. Interactive Game-Based Learning might be used to raise the awareness of students concerning questions of sustainability. Sustainability is a very complex topic. By intera...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Recent and next-generation wireless broadcasting standards, such as DVB-T2 or DVB-NGH, are considering distributed multi-antenna transmission in order to increase bandwidth effic...
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...