scientific article; zbMATH DE number 2002586
From MaRDI portal
Publication:4435431
zbMath1026.68139MaRDI QIDQ4435431
Ran Libeskind-Hadas, Jeffrey R. Hartline
Publication date: 10 November 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40)
Related Items (5)
Generalized Pete's Pike is PSPACE-complete ⋮ Unnamed Item ⋮ Quell ⋮ \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete ⋮ Ice sliding games
This page was built for publication: