For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
57
views
5
references
 Top references
cited by
56
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      3,265
      similar
       All similar
      • 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

      Author(s): ,
      Publication date Created:
      Publication date (Print):
      Journal: Theoretical Computer Science
      Publisher: 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 references5

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

          Relationships between nondeterministic and deterministic tape complexities

          Walter J. Savitch (1970)
          Article 0 comments Cited 115 times – based on 0 reviews     Review now
            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"

            J.T. Schwartz, J.E. Hopcroft, M Sharir (2016)
            Article 0 comments Cited 58 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

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

              Gary William Flake, Eric Baum (2002)
              Article 0 comments Cited 14 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and article information

                Journal
                Title: Theoretical Computer Science
                Abbreviated Title: Theoretical Computer Science
                Publisher: Elsevier BV
                ISSN (Print): 03043975
                Publication date Created: October 2005
                Publication date (Print): October 2005
                Volume: 343
                Issue: 1-2
                Pages: 72-96
                Article
                DOI: 10.1016/j.tcs.2005.05.008
                SO-VID: bfc2938c-3459-4561-965f-90f226c9e15d
                Copyright © © 2005
                License:

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

                History

                Data availability:

                Comments

                Comment on this article