The Complexity of Snake
From MaRDI portal
Publication:5282809
DOI10.4230/LIPICS.FUN.2016.11zbMATH Open1369.68235OpenAlexW2474076045MaRDI QIDQ5282809FDOQ5282809
Authors: Marzio De Biasi, Tim Ophelders
Publication date: 17 July 2017
Full work available at URL: https://doi.org/10.4230/lipics.fun.2016.11
Recommendations
- scientific article; zbMATH DE number 1498834
- Snakes: from graceful to harmonious
- scientific article; zbMATH DE number 5250978
- The Complexity of Complexity
- Rational snakes
- scientific article; zbMATH DE number 1472114
- scientific article; zbMATH DE number 21365
- scientific article; zbMATH DE number 2061441
- Snakes in Movement
- On the snake in the box problem
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43)
Cited In (7)
- The complexity of Snake and undirected NCL variants
- Title not available (Why is that?)
- A world without pythons would be so simple
- The parameterized complexity of motion planning for snake-like robots
- Building a better Mouse Maze
- Title not available (Why is that?)
- \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete
This page was built for publication: The Complexity of Snake
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282809)