On a criterion of NP-completeness
- 20 Downloads
We consider the problem of construction of criteria of completeness of sets with respect to polynomially bounded reducibilities. We present a nonstandard description of sets from the class NP, a brief proof of an analog of the well-known Cook theorem, and a criterion of NP-completeness.
KeywordsRecursive Function Computable Enumeration Mass Problem Algorithmic Language Associate Polynomial
- 4.A. Cobham, “The intrinsic computational difficulty of functions,” in: Proceedings of the Internat. Cong. on Logic Methodology and Phil. Sci., North-Holland (1964), pp. 24–30.Google Scholar