The Computational Complexity of the Game of Set and Its Theoretical Applications

DOI10.1007/978-3-642-54423-1_3zbMath1405.68142arXiv1309.6504OpenAlexW2963092809MaRDI QIDQ5405025

Michael Lampis, Valia Mitsou

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.6504

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Related Items (7)

Unnamed Item ⋮ Winner determination algorithms for graph games with matching structures ⋮ \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\) ⋮ Hanabi is NP-hard, even for cheaters who look at their cards ⋮ A generalization of \textsc{Arc-Kayles} ⋮ Winner determination algorithms for graph games with matching structures ⋮ Rikudo is NP-complete

This page was built for publication: The Computational Complexity of the Game of Set and Its Theoretical Applications