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

      Schaefer's Theorem for Graphs

      ,
      Journal of the ACM
      Association for Computing Machinery (ACM)

      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 references24

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

          The complexity of satisfiability problems

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

            Classifying the Complexity of Constraints Using Finite Algebras

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

              Closure properties of constraints

                Bookmark

                Author and article information

                Journal
                Journal of the ACM
                J. ACM
                JACM
                Association for Computing Machinery (ACM)
                00045411
                June 30 2015
                June 30 2015
                : 62
                : 3
                : 1-52
                Article
                10.1145/2764899
                c73ec8b3-1f95-429b-a1ca-9e5383f5d713
                © 2015

                http://www.acm.org/publications/policies/copyright_policy#Background

                History

                Comments

                Comment on this article