Pages that link to "Item:Q1248466"
From MaRDI portal
The following pages link to On the complexity of some two-person perfect-information games (Q1248466):
Displayed 50 items.
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- \textsf{PSPACE}-complete two-color planar placement games (Q2002060) (← links)
- A generalization of \textsc{Arc-Kayles} (Q2002065) (← links)
- \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
- Colored cut games (Q2087453) (← links)
- Sprague-Grundy theory in bounded arithmetic (Q2118177) (← links)
- On the computational complexities of various geography variants (Q2127615) (← links)
- PSPACE-hardness of two graph coloring games (Q2132363) (← links)
- Backgammon is hard (Q2150573) (← links)
- Winner determination algorithms for graph games with matching structures (Q2169988) (← links)
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\) (Q2182309) (← links)
- PSPACE-completeness of two graph coloring games (Q2182325) (← links)
- Maker-breaker total domination game (Q2185735) (← links)
- Game connectivity of graphs (Q2198411) (← links)
- Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs (Q2290510) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Simplicial complexes are game complexes (Q2318782) (← links)
- The game total domination problem is log-complete in PSPACE (Q2361492) (← links)
- The shortest connection game (Q2403801) (← links)
- Games on triangulations (Q2570126) (← links)
- The maker-breaker largest connected subgraph game (Q2680987) (← links)
- On structural parameterizations of Node Kayles (Q2695476) (← links)
- The complexity of two colouring games (Q2696280) (← links)
- The connected greedy coloring game (Q2699943) (← links)
- A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals (Q2700612) (← links)
- Havannah and TwixT are PSPACE-complete (Q2947922) (← links)
- Single-Player and Two-Player Buttons & Scissors Games (Q2958087) (← links)
- The diameter game (Q3055780) (← links)
- Exact Algorithms for Kayles (Q3104765) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
- (Q3390712) (← links)
- (Q3390714) (← links)
- Strings-and-Coins and Nimstring are PSPACE-complete (Q3390719) (← links)
- (Q3390728) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- A characterization of Zm-well-covered graphs of girth 6 or more (Q4948753) (← links)
- Computational Hardness of Multidimensional Subtraction Games (Q5042244) (← links)
- The Polynomial Profile of Distance Games on Paths and Cycles (Q5042429) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)
- The Complexity of Poset Games (Q5084701) (← links)
- (Q5090999) (← links)
- Playing Savitch and Cooking Games (Q5187817) (← links)
- Connected Subtraction Games on Subdivided Stars (Q5207818) (← links)
- A vertex and edge deletion game on graphs (Q5384206) (← links)
- The complexity of recursion theoretic games (Q5694972) (← links)
- The subset sum game revisited (Q5918370) (← links)
- The largest connected subgraph game (Q5918781) (← links)
- The largest connected subgraph game (Q5925553) (← links)
- Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765) (← links)
- Winner determination algorithms for graph games with matching structures (Q6119832) (← links)