Ukrainian Mathematical Journal

, 50:1924 | Cite as

On a criterion of NP-completeness

  • V. K. Bulitko
  • V. V. Bulitko
Brief Communications


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.


Recursive Function Computable Enumeration Mass Problem Algorithmic Language Associate Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).zbMATHGoogle Scholar
  2. 2.
    M. R. Garey and D. S. Jonson, Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979).zbMATHGoogle Scholar
  3. 3.
    L. Stockmeyer, “Classifying the computational complexity of problems,” J. Symb. Logic, 52, No. 1, 1–43 (1987).zbMATHCrossRefMathSciNetGoogle Scholar
  4. 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
  5. 5.
    H. Yamada, “Real-time computation and the recursive functions not real-time computable,” IRE Trans. El. Comp., EC-11, 753–760 (1962).CrossRefGoogle Scholar

Copyright information

© Kluwer Academic/Plenum Publishers 1999

Authors and Affiliations

  • V. K. Bulitko
    • 1
  • V. V. Bulitko
    • 1
  1. 1.Odessa UniversityOdessa

Personalised recommendations