The Complexity of Escaping Labyrinths and Enchanted Forests.

DOI10.4230/LIPIcs.FUN.2018.30zbMath1489.68112OpenAlexW2808831986MaRDI QIDQ3301022

Florian D. Schwahn, Clemens Thielen

Publication date: 11 August 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/fun/fun2018.html#SchwahnT18

zbMATH Keywords

computational complexitycombinatorial game theoryboard gamesLabyrinthEnchanted Forest

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Uses Software

• WASP

Cites Work

• Unnamed Item
• Powers of tensors and fast matrix multiplication
• Provably Difficult Combinatorial Games

This page was built for publication: The Complexity of Escaping Labyrinths and Enchanted Forests.