scientific article

zbMath0749.03031MaRDI QIDQ4011103

Stephen A. Cook

Publication date: 27 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

feasibilityconstructive proofshigher typespolytime

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Related Items

Skolem functions of arithmetical sentences. ⋮ Functional interpretations of feasibly constructive arithmetic ⋮ Polynomial Running Times for Polynomial-Time Oracle Machines