Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. PushPush and Push-1 are NP-hard in 2D;Demaine,2000
2. PushPush-k is PSPACE-complete;Demaine,2004
3. Randolphs robot game is NP-hard!;Engels;Electron. Notes Discrete Math.,2006
4. Rush Hour is PSPACE-complete, or “Why you should generously tip parking lot attendants”;Flake;Theoret. Comput. Sci.,2002
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Snowman is PSPACE-complete;Theoretical Computer Science;2017-05