In second half 2000 was proved

Theorem: The class of NP-complete problems is coincides with the class P.

   The proof of this theorem, whose brief formulation is NP=P, is contained in the book

     In the references to this book we assume designation [PP]

     At all importance of theorem NP=P nevertheless it is necessary to recognize, that the continuation of the positionality principle from the numbers to the function is more important and it is possible to assume that without this continuation hardly it is possible to prove that NP=P.

    On March, 2003,  the Institute of space researches of the Russian Academy of Science has issued the first volume of the book.
 1. First part of the book (in Russian).
 2. Bibliography of the book (in Russian).
 3. About a positionality principle (from book).
 4. About an arithmetization of functions (from book).
 5. About a book [PP].
 6. Even about the theorem NP = P.
 7. Even about the superreduction.
 7a). Use of superreduction on the practical problems.
 8. Demonstrative examples:
      - 8a)  *.doc format;
      -  8b) *.html format;
 9. Warning to users by cryptography with the public key.
 10. Bibliography.

Last modified: May 31, 2009      Home page

For contact:  mit@tarusa.ru