|
Morozenko, Vladimir Viktorovich
|
Statistics Math-Net.Ru |
Total publications: |
3 |
Scientific articles: |
3 |
Number of views: |
This page: | 469 | Abstract pages: | 921 | Full texts: | 337 |
|
|
Associate professor |
|
Candidate of physico-mathematical sciences (1990) |
Speciality: |
01.01.09 (Discrete mathematics and mathematical cybernetics) |
Birth date: |
16.09.1964 |
E-mail: |
|
Keywords: |
combinatorial optimization, complexity of algorithm, polynomial algorithm, NP-completeness.
|
UDC: |
519.712, 519.718.3 |
Subject: |
Algorithms of combinatorial optimization.
|
|
|
Main publications: |
-
Morozenko V. V., “O slozhnosti sortirovki bulevoi algebry”, Diskretnaya matematika, 3:1 (1991), 42–47
-
Morozenko V. V., “O slozhnosti samokorrektiruyuschikhsya algoritmov dlya dvukh zadach sortirovki”, Diskretnaya matematika, 1:3 (1989), 111–120
-
Morozenko V. V., “O slozhnosti samokorrektiruyuschikhsya algoritmov dlya dvukh zadach poiska”, Diskretnaya matematika, 2:3 (1990), 50–55
|
|
![](/refsvg/svg/mathnet.svg) |
https://www.mathnet.ru/eng/person29854 |
![](/refsvg/svg/scholar_logo_eng.svg) |
List of publications on Google Scholar |
![](/refsvg/svg/zmath.svg) |
List of publications on ZentralBlatt |
![](/refsvg/svg/mathscinet.svg) |
https://mathscinet.ams.org/mathscinet/MRAuthorID/289595 |
|
|
|
Publications in Math-Net.Ru |
Citations |
|
1991 |
1. |
V. V. Morozenko, “On the complexity of sorting of Boolean algebra”, Diskr. Mat., 3:1 (1991), 42–47 ; Discrete Math. Appl., 2:3 (1992), 313–318 |
1
|
|
1990 |
2. |
V. V. Morozenko, “Complexity of self-correcting algorithms for two search problems”, Diskr. Mat., 2:3 (1990), 50–55 |
|
1989 |
3. |
V. V. Morozenko, “Complexity of self-correcting algorithms for two sorting problems”, Diskr. Mat., 1:3 (1989), 111–120 |
|
Organisations |
|
| |