---

Solved a problem of finding the most difficult disjunctive form in a class of monotone function of algebra of logic. Considered a family of subsets of finite sets incomparable by relation of binary inclusion. Studied typical properties of those families. Almost all of those families have certain value of a certain established parameter. Considered problems of P and NP classes. Proved that P NP. Demonstrated that NP-compete problems, introduced independently by S.A.Cook and L.A.Levin. In particular, proved that problem of recognition of Hamilton graph, which is NP-complete problem as proven by R.Karp, is a non-polynomial problem. Thus, all NP-complete problem are non-polynomial. Completely solved problem of diophantus equations. Namely, demonstrated that for n = 3 and n = 4 diophantus equation has radical solution and for n 5 diophantus equations are algorithmically unsolvable.

---

Graduated from Kazan State University at 1960. Received PhD degree 1969 in Kiev Cybernetics Institute. Associate professor since 1976.

---