Add to ORKGAbstract: In this paper we study the computational complexity of the game of Scrabble. We prove the PSPACE
The game domination number is a graph invariant that arises from a game, which is related to graph d...
We study the connection between pebble games and complexity.First, we derive complexity results usin...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
International audienceIn this paper we study the computational complexity of the game of Scrabble. W...
The complexity of the Black-White Pebbling Game has remained an open problem for 30 years. It was de...
We study the computational complexity of deciding the existence of a Pure Nash Equilibrium or a subg...
We consider the pebble game on DAGs with bounded fan-in introduced in [Paterson and Hewitt ’70] and ...
We consider the n n game of Phutball. It is shown that, given an arbitrary position of stones on th...
The physics-based simulation game Angry Birds has been heavily researched by the AI community over t...
AbstractWe consider the n×n game of Phutball. It is shown that, given an arbitrary position of stone...
Abstract. UNO r © is one of the world-wide well-known and popular card games. We investigate UNO fro...
is an important two-player impartial combinatorial game. The rule of the game is as follows: For a g...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
In this paper we present several proofs for the computational complexity of the physics-based video ...
Abstract In this paper we investigate the following game: two players I and II must alternately pack...
The game domination number is a graph invariant that arises from a game, which is related to graph d...
We study the connection between pebble games and complexity.First, we derive complexity results usin...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
International audienceIn this paper we study the computational complexity of the game of Scrabble. W...
The complexity of the Black-White Pebbling Game has remained an open problem for 30 years. It was de...
We study the computational complexity of deciding the existence of a Pure Nash Equilibrium or a subg...
We consider the pebble game on DAGs with bounded fan-in introduced in [Paterson and Hewitt ’70] and ...
We consider the n n game of Phutball. It is shown that, given an arbitrary position of stones on th...
The physics-based simulation game Angry Birds has been heavily researched by the AI community over t...
AbstractWe consider the n×n game of Phutball. It is shown that, given an arbitrary position of stone...
Abstract. UNO r © is one of the world-wide well-known and popular card games. We investigate UNO fro...
is an important two-player impartial combinatorial game. The rule of the game is as follows: For a g...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
In this paper we present several proofs for the computational complexity of the physics-based video ...
Abstract In this paper we investigate the following game: two players I and II must alternately pack...
The game domination number is a graph invariant that arises from a game, which is related to graph d...
We study the connection between pebble games and complexity.First, we derive complexity results usin...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
_-_2016.png%3Fwidth%3D300&w=3840&q=75){kind=logo}
