Publication:3305725

DOI10.4230/LIPIcs.FUN.2018.7zbMath1489.68101MaRDI QIDQ3305725

Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra

Publication date: 11 August 2020

zbMATH Keywords

puzzle; NP-completeness; combinatorial game theory; perfect information

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

91A46: Combinatorial games