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

      The complexity of satisfiability problems

      proceedings-article
      Author(s):
      Publication date (Print):
      Conference name: the tenth annual ACM symposium (STOC '78)
      Conference date: June 01, 1978 - June 03, 1978

      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

          Conference
          Publication date (Print): 1978
          Pages: 216-226
          Article
          DOI: 10.1145/800133.804350
          SO-VID: b92a1d85-ec59-402b-ae18-ce44162f0a5a
          Copyright © © 1978
          Conference name: the tenth annual ACM symposium
          Conference acronym: STOC '78
          Conference number: 10
          Conference location: San Diego, California, United States
          Conference date: June 01, 1978 - June 03, 1978
          Conference sponsor: ACM, Association for Computing Machinery
          Conference sponsor: SIGACT, ACM Special Interest Group on Algorithms and Computation Theory
          History

          Data availability:

          Comments

          Comment on this article

          scite_

          Similar content2,563

          See all similar

          Cited by233

          See all cited by