البيان رقم صفر

Home

❯

refs

❯

The complexity of theorem-proving procedures

The complexity of theorem-proving procedures

Cook, Stephen A., ‘Complexity’: ‘The complexity of theorem-proving procedures’, Proceedings of the third annual ACM symposium on Theory of computing, STOC '71, New York, NY, USA: Association for Computing Machinery, 3 May 1971, pp 151–158.

conference paper · https://doi.org/10.1145/800157.805047


Graph View

Backlinks

  • Stephen A. Cook
  • Proceedings of the third annual ACM symposium on Theory of computing
  • Some varieties of idealisation
  • The asymptotics of language