Naidenko V. G. K probleme P =? NP // Doklady AN / Rossiiskaya akademiya, 1996, t. 348, # 6, s. 731–732.
Naidenko V. G. Problema kompozitsii konstruktivnykh transrekursivnykh operatorov // Doklady AN / Rossiiskaya akademiya, 1996, t. 349, # 1, s. 20–21.
Metelskii N. N., Naidenko V. G. Chastichno-vypuklye obolochki v prostranstve $R^n$ // Vestsi NAN Belarusi. Ser. fiz.-mat. navuk, 1999, # 4, s. 47–52.
Metelskii N. N., Naidenko V. G. Algoritmicheskie aspekty chastichnoi vypuklosti // Matematicheskie zametki, 2000, t. 68, vyp. 3, s. 399–410.
Naidenko V. G., Orlovich Yu. L. Nezavisimye i dominiruyuschie mnozhestva v $K_{1,r}$-svobodnykh grafakh // Vestsi NAN Belarusi. Ser. fiz.-mat. navuk, 2000, # 2, s. 126–130.
V. G. Naidenko, “The problem of the composition of constructive transrecursive
operators”, Dokl. Akad. Nauk, 349:1 (1996), 20–21
5.
V. G. Naidenko, “On the problem $\mathrm{P}=?NP$”, Dokl. Akad. Nauk, 348:6 (1996), 731–732
1992
6.
O. V. German, E. I. Germanovich, V. G. Naidenko, “Boolean optimization algorithm on $(0,1)$-matrices”, Zh. Vychisl. Mat. Mat. Fiz., 32:7 (1992), 1114–1125; Comput. Math. Math. Phys., 32:7 (1992), 995–1005
1996
7.
V. G. Naidenko, “Erratum: "On the problem $\mathrm{P}=?NP$"”, Dokl. Akad. Nauk, 351:3 (1996), 430
Contact us: