Publication:4779132
From MaRDI portal
zbMath1021.91009MaRDI QIDQ4779132
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360018
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
91A46: Combinatorial games
Related Items
Layered Battleship Game Changer Password System, Playing Savitch and Cooking Games, A Global Approach for Solving Edge-Matching Puzzles, On the computational complexity of bridgecard, Unnamed Item, Strategies in competing subset selection, Impartial coloring games, UNO is hard, even for a single player, Phutball is PSPACE-hard, Hanabi is NP-hard, even for cheaters who look at their cards, The complexity of node blocking for dags, Zen puzzle garden is NP-complete, On variants of vertex geography on undirected graphs, On the transformation capability of feasible mechanisms for programmable matter, Equilibrium paths in discounted supergames, Ice sliding games, Pushing lines helps: efficient universal centralised transformations for programmable matter, Wooden geometric puzzles: Design and hardness proofs, Twenty years of progress of \(\mathrm{JCDCG}^3\), Towards an algorithmic guide to Spiral Galaxies, On bichromatic triangle game, Games on triangulations, PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation, Restricted Power - Computational Complexity Results for Strategic Defense Games
