![]() |
CiteULike | ![]() |
stavros's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
The complexity of theorem-proving proceduresby: Stephen A. Cook
In STOC '71: Proceedings of the third annual ACM symposium on Theory of computing (1971), pp. 151-158.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
BibTeX record
RIS record