AbstractGames in which players build domino tilings are considered. The computational complexity of problems of existence of winning strategies is investigated. These problems are shown to be complete in the respective complexity classes, e.g., SQUARE TILING GAME is complete in PSPACE, HIGH TILING GAME is complete in 2EXPTIME and has a doubly exponential time lower bound. As an application, new simple hardness proofs for certain propositional logics are obtained
© 2020 Information Processing Society of Japan. We analyze the computational complexity of several n...
Deciding infinite two-player games on finite graphs with the winning condition specified by a linear...
Combinatorial games are a fascinating topic, as both recreational and serious mathematics. One aspec...
AbstractGames in which players build domino tilings are considered. The computational complexity of ...
Abstract. Tiling planar regions with dominoes is a classical problem in which the decision and count...
Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a ...
AbstractThe complexities of two domino problems, namely the (n,k) domain problem and the (n,k) 2-per...
AbstractWe prove NP-hardness of six families of naturally defined, interesting board games. Some of ...
AbstractFor a number of two-player games where players alternately choose the next vertex of a simpl...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
Abstract. We rst consider innite two-player games on pushdown graphs. In previous work, Cachat, Dupa...
AbstractWe first consider infinite two-player games on pushdown graphs. In previous work, Cachat et ...
AbstractQuestion/Answer games (Q/A games for short) are a generalization of the Rényi–Ulam game and ...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and...
© 2020 Information Processing Society of Japan. We analyze the computational complexity of several n...
Deciding infinite two-player games on finite graphs with the winning condition specified by a linear...
Combinatorial games are a fascinating topic, as both recreational and serious mathematics. One aspec...
AbstractGames in which players build domino tilings are considered. The computational complexity of ...
Abstract. Tiling planar regions with dominoes is a classical problem in which the decision and count...
Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a ...
AbstractThe complexities of two domino problems, namely the (n,k) domain problem and the (n,k) 2-per...
AbstractWe prove NP-hardness of six families of naturally defined, interesting board games. Some of ...
AbstractFor a number of two-player games where players alternately choose the next vertex of a simpl...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
Abstract. We rst consider innite two-player games on pushdown graphs. In previous work, Cachat, Dupa...
AbstractWe first consider infinite two-player games on pushdown graphs. In previous work, Cachat et ...
AbstractQuestion/Answer games (Q/A games for short) are a generalization of the Rényi–Ulam game and ...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and...
© 2020 Information Processing Society of Japan. We analyze the computational complexity of several n...
Deciding infinite two-player games on finite graphs with the winning condition specified by a linear...
Combinatorial games are a fascinating topic, as both recreational and serious mathematics. One aspec...
DOI
Add to ORKG