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

      On the complexity of reconfiguration problems

      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 references9

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          The complexity of satisfiability problems

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

            Some optimal inapproximability results

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

              Relationships between nondeterministic and deterministic tape complexities

                Bookmark

                Author and article information

                Journal
                Theoretical Computer Science
                Theoretical Computer Science
                Elsevier BV
                03043975
                March 2011
                March 2011
                : 412
                : 12-14
                : 1054-1065
                Article
                10.1016/j.tcs.2010.12.005
                0e6c319a-97a8-4948-a9e5-5de46e0bbe06
                © 2011

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

                History

                Comments

                Comment on this article