JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
Adigeyev, Mikhail Georgievich
Statistics Math-Net.Ru
Total publications: 2
Scientific articles: 2
Number of views: This page: 360 Abstract pages: 481 Full texts: 179 References: 73
Candidate of technical sciences (2000)
Speciality:
05.13.16 (Application of Computers and Mathematical Models in Science)
Birth date:
12.03.1973
E-mail:
email
Keywords:
bioinformatics, computational molecular biology, algorithms complexity, computationally hard problems, parallel computations.
Subject:
Bioinformatics, algorithms complexity, computationally hard problems, parallel computations, information security models, cryptography.
Main publications:
Nerazdelennyi kommutatsionnyi graf s chislom vershin // Matematicheskie zametki, t. 58, 1995, vyp. 3, s. 323–333.
O metode postroeniya kommutatsionnykh skhem, realizuyuschikh semeistvo reshetok // Dep. VINITI # 1698-V99 ot 28.05.99 g.
Kommutatsionnaya skhema dlya sistem obrabotki izobrazhenii // Trudy mezhdunarodnoi nauchno-tekhnicheskoi konferentsii "Intellektualnye mnogoprotsessornye sistemy" (IMS'99), 1–5 sentyabrya 1999 g., g. Taganrog, s. 197–202.
https://www.mathnet.ru/eng/person19818
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/602443
Publications in Math-Net.Ru Citations
2014
1.
M.G. Adigeev, “On polynomial time complexity of ultrametric versions of certain NP-hard problems”, Inform. Primen. , 8 :2 (2014), 70–76
1995
2.
M. G. Adigeyev, “Indecomposable switching graph with the number of vertices $N\log_2N-\frac 94N$ ”, Mat. Zametki , 58 :3 (1995), 323–333 Math. Notes , 58 :3 (1995), 897–904
Organisations
Contact us: