scientific article; zbMATH DE number 1834637
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
Related Items
On variants of vertex geography on undirected graphs, Strategies in competing subset selection, Restricted Power - Computational Complexity Results for Strategic Defense Games, Impartial coloring games, UNO is hard, even for a single player, Pushing lines helps: efficient universal centralised transformations for programmable matter, The complexity of node blocking for dags, Layered Battleship Game Changer Password System, Phutball is PSPACE-hard, Unnamed Item, On bichromatic triangle game, On the transformation capability of feasible mechanisms for programmable matter, Equilibrium paths in discounted supergames, Hanabi is NP-hard, even for cheaters who look at their cards, Wooden geometric puzzles: Design and hardness proofs, Playing Savitch and Cooking Games, Ice sliding games, On the computational complexity of bridgecard, Twenty years of progress of \(\mathrm{JCDCG}^3\), Zen puzzle garden is NP-complete, Games on triangulations, PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation, A Global Approach for Solving Edge-Matching Puzzles, Towards an algorithmic guide to Spiral Galaxies
