Blog
About

17
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation

      ,

      Theoretical Computer Science

      Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Most cited references 5

          • Record: found
          • Abstract: not found
          • Article: not found

          Relationships between nondeterministic and deterministic tape complexities

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem"

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Rush Hour is PSPACE-complete, or “Why you should generously tip parking lot attendants”

                Bookmark

                Author and article information

                Journal
                Theoretical Computer Science
                Theoretical Computer Science
                Elsevier BV
                03043975
                October 2005
                October 2005
                : 343
                : 1-2
                : 72-96
                10.1016/j.tcs.2005.05.008
                © 2005

                http://www.elsevier.com/tdm/userlicense/1.0/

                Comments

                Comment on this article