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

      The complexity of temporal constraint satisfaction problems

        ,
      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

          Author and article information

          Journal
          Journal of the ACM
          J. ACM
          Association for Computing Machinery (ACM)
          00045411
          January 01 2010
          January 01 2010
          : 57
          : 2
          : 1-41
          Article
          10.1145/1667053.1667058
          e46dcd12-e75c-4f5e-a24e-d8a7550b1215
          © 2010
          History

          Comments

          Comment on this article