scientific article; zbMATH DE number 7075886

MaRDI QIDQ4967182zbMATH OpenFDO

Authors John D. Rogers, S. Fenner

Publication date 3 July 2019

Full work available at URL https://arxiv.org/abs/1505.07416, http://bulletin.eatcs.org/index.php/beatcs/article/view/355/337

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial games (91A46)

Recommendations

• The complexity of poset games
• On the complexity of computing winning strategies for finite poset games
• Recent results and questions in combinatorial game complexities
• The parameterized complexity of positional games
• Complexity, appeal and challenges of combinatorial games
• On the complexity of chooser-picker positional games
• The computational complexity of the game of Set and its theoretical applications
• scientific article; zbMATH DE number 3952008
• Combinatorial games on a graph

Cited in

(23)

• Recent results and questions in combinatorial game complexities
• Chomp on numerical semigroups
• Complexity, appeal and challenges of combinatorial games
• Chomp on generalized Kneser graphs and others
• Proper 2-coloring game on some trees
• Pomax games -- a family of integer-valued partizan games played on posets
• Enumerative properties of posets corresponding to a certain class of games of no strategy
• Advances in finding ideal play on poset games
• scientific article; zbMATH DE number 5133448 (Why is no real title available?)
• Game values and computational complexity: an analysis via black-white combinatorial games
• scientific article; zbMATH DE number 16390 (Why is no real title available?)
• scientific article; zbMATH DE number 1944416 (Why is no real title available?)
• scientific article; zbMATH DE number 2124071 (Why is no real title available?)
• Transverse wave: an impartial color-propagation game inspired by social influence and quantum nim
• Advances in finding ideal play on poset games
• The complexity of poset games
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
• On the complexity of computing winning strategies for finite poset games
• Thinning thickets
• A vertex and edge deletion game on graphs
• The Game of n-Player Shove and Its Complexity
• Flipping the winner of a poset game
• Winning positions in simplicial Nim

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967182)