Zobrazeno 1 - 6
of 6
pro vyhledávání: '"V. G. Naidenko"'
Autor:
V. G. Naidenko
Publikováno v:
Informatika, Vol 15, Iss 4, Pp 99-101 (2018)
A problem to describe the complexity class BPP in terms of a logical language is considered. BPP (abbreviation for bounded-error probablistic polynomial time) represents the class of computational decision problems that are efficiently solvable in po
Externí odkaz:
https://doaj.org/article/bc31c689c3ad412f97f98ebe78af83f2
Autor:
V. G. Naidenko
Publikováno v:
Informatika, Vol 0, Iss 3, Pp 101-104 (2016)
The problem of recursive (algorithmic) representation is considered for the complexity class NPcoNP. A new method is proposed for algorithmically enumerating all problems in NPcoNP, using polynomial-time nondeterministic Turing machines.
Externí odkaz:
https://doaj.org/article/ea0cb62c9fea47c2bf3878f3b67b5afb
Autor:
V. G. Naidenko
Publikováno v:
Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series. 54:38-43
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d9c2b1b0a4d12a72d220ef725af9d68
https://doi.org/10.29235/1561-2430-2018-54-1-38-43
https://doi.org/10.29235/1561-2430-2018-54-1-38-43
Autor:
V. G. Naidenko
Publikováno v:
Mathematical Notes. 85:868-876
The Fink-Wood problem on the contractibility of half-spaces of partial convexity is studied. It is proved that there exists a connected non-simply-connected half-space of orthocon-vexity in the three-dimensional space, which disproves the Fink-Wood c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f8f8ed2c7e0da623461c9f2cd701359
https://doi.org/10.1134/s0001434609050277
https://doi.org/10.1134/s0001434609050277
Autor:
V. G. Naidenko
Publikováno v:
Mathematical Notes. 75:202-212
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::284b353ea1127ed66e0c65a0912f3494
https://doi.org/10.1023/b:matn.0000015036.94515.c0
https://doi.org/10.1023/b:matn.0000015036.94515.c0
Autor:
N. N. Metel’skii, V. G. Naidenko
Publikováno v:
Mathematical Notes. 68:345-354
A characterization ofC-semispaces of partial convexity is obtained. An estimate of the number ofC-semispaces in the case of finitely many directions of partial convexity is given. A polynomial algorithm for the enumeration ofC-semispaces is developed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::237ba05517dd14267e5ef5014e24f523
https://doi.org/10.1007/bf02674558
https://doi.org/10.1007/bf02674558