Pages that link to "Item:Q5405025"
From MaRDI portal
The following pages link to The Computational Complexity of the Game of Set and Its Theoretical Applications (Q5405025):
Displaying 7 items.
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- A generalization of \textsc{Arc-Kayles} (Q2002065) (← links)
- Rikudo is NP-complete (Q2118858) (← links)
- Winner determination algorithms for graph games with matching structures (Q2169988) (← links)
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\) (Q2182309) (← links)
- (Q3305730) (← links)
- Winner determination algorithms for graph games with matching structures (Q6119832) (← links)
