For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
10
views
10
references
 Top references
cited by
14
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      1,265
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Article: not found

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

      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.

          Related collections

          Most cited references10

          • 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
            • Conference Proceedings: not found

            Complexity of the mover's problem and generalizations

            John Reif (1979)
            Article 0 comments Cited 52 times – based on 0 reviews
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The (n2−1)-puzzle and related relocation problems

              Daniel Ratner, Manfred Warmuth (1990)
              Article 0 comments Cited 24 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: January 2002
                Publication date (Print): January 2002
                Volume: 270
                Issue: 1-2
                Pages: 895-911
                Article
                DOI: 10.1016/S0304-3975(01)00173-6
                SO-VID: 9bbf6e60-8725-473b-87b3-41e7d1cc39ec
                Copyright © © 2002
                License:

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

                History

                Data availability:

                Comments

                Comment on this article