The complexity of theorem-proving procedures (1971)

by Stephen Arthur Cook
Venue:In Proceedings of the third annual ACM symposium on Theory of computing