The computational complexity of the game of SET and its theoretical applications
Valia Mitsou
University of New York, USA
University of New York, USA
2014/05/12 Monday 4PM-5PM
Room 1409
Room 1409
The game of SET is a popular card game in which the objective is to form Sets (triplets of cards that match in a particular sense) using cards from a special deck. For more details regarding the game, please visit the official website: http://www.setgame.com/.
We analyze the computational complexity of some variations of the game of SET, presenting positive as well as hardness results in the classical and parameterized sense. Along the way, we make interesting connections of these generalizations of the game with other combinatorial problems, like Perfect Multi-Dimensional Matching, Set Packing, Independent Edge Dominating Set, and a two-player game played on graphs called Arc Kayles.
We analyze the computational complexity of some variations of the game of SET, presenting positive as well as hardness results in the classical and parameterized sense. Along the way, we make interesting connections of these generalizations of the game with other combinatorial problems, like Perfect Multi-Dimensional Matching, Set Packing, Independent Edge Dominating Set, and a two-player game played on graphs called Arc Kayles.
Tags: ValiaMitsou