The complexity of theorem-proving procedures

Cook, Stephen A.

doi:10.1145/800157.805047

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

The complexity of theorem-proving procedures

proceedings-article

Author(s): Stephen A. Cook

Publication date (Print): 1971

Conference name: the third annual ACM symposium (STOC '71)

Conference date: June 03, 1971 - June 05, 1971

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): 1971

Pages: 151-158

Article

DOI: 10.1145/800157.805047

SO-VID: 60ec5a03-302e-408d-9069-349990f99017

Conference name: the third annual ACM symposium

Conference acronym: STOC '71

Conference number: 3

Conference location: Shaker Heights, Ohio, United States

Conference date: June 03, 1971 - June 05, 1971

Conference sponsor: SIGACT, ACM Special Interest Group on Algorithms and Computation Theory

The complexity of theorem-proving procedures

Read this article at

Related collections

ScienceOpen Research

Author and article information

Conference

Article

History

Comments

Comment on this article

Similar content 2,886

Cited by 401