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

      An optimal lower bound on the number of variables for graph identification

      , ,
      Combinatorica
      Springer Nature

      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 references13

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

          The graph isomorphism disease

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

            Relational queries computable in polynomial time

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

              Languages that Capture Complexity Classes

                Bookmark

                Author and article information

                Journal
                Combinatorica
                Combinatorica
                Springer Nature
                0209-9683
                1439-6912
                December 1992
                December 1992
                : 12
                : 4
                : 389-410
                Article
                10.1007/BF01305232
                8d1bfc6c-55b9-4521-b689-35215b755384
                © 1992
                History

                Comments

                Comment on this article