Publication:3395518
From MaRDI portal
zbMath1175.91035MaRDI QIDQ3395518
Robert A. Hearn, Erik D. Demaine
Publication date: 4 September 2009
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Other game-theoretic models (91A40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) Combinatory logic and lambda calculus (03B40)
Related Items
The complexity of Snake and undirected NCL variants, Trainyard is NP-hard, Games, Puzzles and Treewidth, Consensus Game Acceptors, On the complexity of connection games, A simple proof that the \((n^{2} - 1)\)-puzzle is hard, Complexity of Hamiltonian cycle reconfiguration, Unnamed Item, Imperfect information in reactive modules games, Backgammon is hard, Book review of: E. R. Berlekamp et al., Winning ways for your mathematical plays., Invitation to combinatorial reconfiguration, Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets, Shortest reconfiguration of sliding tokens on subclasses of interval graphs, The Fewest Clues Problem of Picross 3D, The Computational Complexity of Portal and Other 3D Video Games, On the Complexity of Two Dots for Narrow Boards and Few Colors., On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games, Tracks from hell - When finding a proof may be easier than checking it, Impartial games emulating one-dimensional cellular automata and undecidability, Complexity of tiling a polygon with trominoes or bars, Partial order games, PSPACE-completeness of two graph coloring games, On the Exact Complexity of Polyomino Packing, UNO is hard, even for a single player, PSPACE-Completeness of Bloxorz and of Games with 2-Buttons, Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game, Havannah and TwixT are PSPACE-complete, From heaps of matches to the limits of computability, Reconfiguration in bounded bandwidth and tree-depth, Sorting balls and water: equivalence and computational complexity, Parameterized complexity of independent set reconfiguration problems, Phutball is PSPACE-hard, Generalized Pete's Pike is PSPACE-complete, The general position avoidance game and hardness of general position games, On the exact complexity of polyomino packing, Tracks from hell -- when finding a proof may be easier than checking it, Cooperating in video games? Impossible! Undecidability of team multiplayer games, Defying gravity and gadget numerosity: the complexity of the Hanano puzzle, Puzzle and dragons is hard, On a generalization of ``eight blocks to madness puzzle, Computational complexity of jumping block puzzles, Computational complexity of two pencil puzzles: Kurotto and Juosan, The connected greedy coloring game, Unnamed Item, Unnamed Item, The Parameterized Complexity of Motion Planning for Snake-Like Robots, Approximability of the subset sum reconfiguration problem, Gaming is a hard job, but someone has to do it!, The kissing problem: how to end a gathering when everyone kisses everyone else goodbye, Google Scholar makes it hard -- the complexity of organizing one's publications, Linear-time algorithm for sliding tokens on trees, Consensus Game Acceptors and Iterated Transductions, Quell, Partial-order Boolean games: informational independence in a logic-based model of strategic interaction, Recursed Is Not Recursive: A Jarring Result, Reconfiguration of list \(L(2,1)\)-labelings in a graph, Hanabi is NP-hard, even for cheaters who look at their cards, \textsf{PSPACE}-complete two-color planar placement games, Reconfiguration of list edge-colorings in a graph, Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets, Unnamed Item, Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect, Two-player tower of Hanoi, Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch, Computational complexity of jumping block puzzles, Shortest Reconfiguration of Sliding Tokens on a Caterpillar, Homomorphism Reconfiguration via Homotopy, Token sliding on split graphs, Unnamed Item, The kangaroo problem, Twenty years of progress of \(\mathrm{JCDCG}^3\), Matchstick puzzles on a grid, Reconfiguration of connected graph partitions via recombination, Reconfiguration of connected graph partitions via recombination, \textsf{PSPACE}-hardness of variants of the graph coloring game, Variations on Instant Insanity, PSPACE-completeness of reversible deterministic systems, Towards an algorithmic guide to Spiral Galaxies, On reconfigurability of target sets, Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
