The following pages link to (Q2703803):
Displaying 35 items.
- Computational Hardness of Multidimensional Subtraction Games (Q5042244) (← links)
- On Compatible Matchings (Q5049995) (← links)
- The Complexity of Poset Games (Q5084701) (← links)
- (Q5088677) (← links)
- On the combinatorial value of Hex positions (Q5095319) (← links)
- The Sprague-Grundy function for some selective compound games (Q5109325) (← links)
- (Q5109548) (← links)
- From Combinatorial Games to Shape-Symmetric Morphisms (Q5141334) (← links)
- (Q5148705) (← links)
- (Q5148706) (← links)
- (Q5148707) (← links)
- (Q5148709) (← links)
- Walks: A Beginner's Guide to Graphs and Matrices (Q5158411) (← links)
- Quasiperfect numbers with the same exponent (Q5197514) (← links)
- Connected Subtraction Games on Subdivided Stars (Q5207818) (← links)
- Cumulative subtraction games (Q5210981) (← links)
- (Q5223066) (← links)
- A Probabilistic Two-Pile Game (Q5236569) (← links)
- (Q5244175) (← links)
- (Q5384137) (← links)
- (Q5384203) (← links)
- A vertex and edge deletion game on graphs (Q5384206) (← links)
- (Q5887818) (← links)
- Smash and grab: the \(0 \cdot 6\) scoring game on graphs (Q6120354) (← links)
- Particle computation: complexity, algorithms, and logic (Q6150976) (← links)
- Book review of: D. Nirenberg and R. L. Nirenberg, Uncountable. A philosophical history of number and humanity from antiquity to the present (Q6169830) (← links)
- Sprague-Grundy values and complexity for LCTR (Q6193951) (← links)
- Analysing emergent dynamics of evolving computation in 2D cellular automata (Q6536358) (← links)
- A variant of Nim played on Boolean matrices (Q6546731) (← links)
- The computational complexity of forced capture Hnefatafl (Q6562456) (← links)
- Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem (Q6562875) (← links)
- Generalized impartial two-player pebbling games on \(K_3\) and \(C_4\) (Q6566538) (← links)
- Screw discrete dynamical systems and their applications to exact slow NIM (Q6611084) (← links)
- Chess is hard even for a single player (Q6614005) (← links)
- Indecomposable combinatorial games (Q6637143) (← links)
