The Complexity of Solitaire
From MaRDI portal
Publication:3525567
DOI10.1007/978-3-540-74456-6_18zbMath1147.68536OpenAlexW4206821144MaRDI QIDQ3525567
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_18
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
This page was built for publication: The Complexity of Solitaire