 The P versus NP Problem by Stephen A. Cook

Official Clay Mathematics Institute problem description by Stephen A. Cook.

Primary PDF: www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf

Section 1 defines finite-alphabet languages, machine acceptance, worst-case running time, P and polynomially bounded verification for NP. The PDF upload path is not treated as its publication date.