Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Shamil Ishmukhametov"'
Publikováno v:
Symmetry
Volume 12
Issue 6
Symmetry, Vol 12, Iss 890, p 890 (2020)
Volume 12
Issue 6
Symmetry, Vol 12, Iss 890, p 890 (2020)
In this paper, we investigate the popular Miller&ndash
Rabin primality test and study its effectiveness. The ability of the test to determine prime integers is based on the difference of the number of primality witnesses for composite and prime
Rabin primality test and study its effectiveness. The ability of the test to determine prime integers is based on the difference of the number of primality witnesses for composite and prime
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eba4031cc22e7a8e5dba2970367bd2d1
Publikováno v:
Lobachevskii Journal of Mathematics. 39:1010-1015
In our paper we give theoretical and practical estimations of the error probability in the well-known Miller–Rabin probabilistic primality test. We show that a theoretical probability of error 0.25 for a single round of the test is very overestimat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99c171cef1b6c35b151078d49ae05fdb
https://doi.org/10.1134/s1995080218070132
https://doi.org/10.1134/s1995080218070132
Publikováno v:
Lobachevskii Journal of Mathematics. 37:128-137
An integer number n > 0 is called y-smooth for y > 0 if any prime factor p of n satisfies p ≤ y. Let ψ(x, y) be the number of all y-smooth integers less or equal to x. In this paper we elaborate a new algorithm for approximate calculation of ψ(x,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34065310f07035b3630ca80a657c1dba
https://doi.org/10.1134/s1995080216020062
https://doi.org/10.1134/s1995080216020062
Autor:
Ilya Vlasov, Shamil Ishmukhametov, Rustam Latypov, Evgeni Stolov, Albert Galiev, Nikolai Prokopyev
Publikováno v:
2018 Second World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4).
In this paper, we present a novel archival system called ARCHAIN, developed for the State Archive-keeping Committee of the Republic of Tatarstan (Russia). Blockchain is the principal part of the system, which stores transactions (facts of transfer of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf70bfe43d734807462601a6812d2185
https://doi.org/10.1109/worlds4.2018.8611607
https://doi.org/10.1109/worlds4.2018.8611607
Autor:
Shamil Ishmukhametov, B. Mubarakov
Publikováno v:
Lobachevskii Journal of Mathematics. 34:304-312
The well-known Miller-Rabin Primality Test MRPT is used to check naturals to be prime or composite. We study the dependence between the length of testing numbers and the number of rounds of MRPT sufficient to give the correct answer and give some rec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edbe24f1275e53786fc5ccb3e29c6f7f
https://doi.org/10.1134/s1995080213040100
https://doi.org/10.1134/s1995080213040100
Autor:
Shamil Ishmukhametov
Publikováno v:
J. Symbolic Logic 68, iss. 1 (2003), 52-64
In “Bounding minimal degrees by computably enumerable degrees” by A. Li and D. Yang, (this Journal, [1998]), the authors prove that there exist non-computable computably enumerable degrees c > a > 0 such that any minimal degree m being below c is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ce51d415c0fbc6aa60d1997f01e8d4d
https://doi.org/10.2178/jsl/1045861506
https://doi.org/10.2178/jsl/1045861506
Autor:
Shamil Ishmukhametov, Guohua Wu
Publikováno v:
Archive for Mathematical Logic. 41:259-266
Say that a d.c.e. degree d is isolated by a c.e. degree b, if b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::341f6bb40f4012fff9be577483e91a09
https://doi.org/10.1007/s001530100111
https://doi.org/10.1007/s001530100111
Autor:
Shamil Ishmukhametov
Publikováno v:
Archive for Mathematical Logic. 39:145-154
Let d be a Turing degree, R[d] and Q[d] denote respectively classes of recursively enumerable (r.e.) and all degrees in which d is relatively enumerable. We proved in Ishmukhametov [1999] that there is a degree d containing differences of r.e.sets (b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a4b42703c1a3130b122d87877e447f1
https://doi.org/10.1007/s001530050139
https://doi.org/10.1007/s001530050139
Autor:
Shamil Ishmukhametov
Publikováno v:
Archive for Mathematical Logic. 38:373-386
Let d be a Turing degree containing differences of recursively enumerable sets (d.r.e.sets) and R[d] be the class of less than d r.e. degrees in whichd is relatively enumerable (r.e.). A.H.Lachlan proved that for any non-recursive d.r.e. d R[d] is no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ac5f7f7b695c9b050c2930d2fd434ea
https://doi.org/10.1007/s001530050132
https://doi.org/10.1007/s001530050132
Autor:
Shamil Ishmukhametov
Publikováno v:
Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14-19, 1997
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90213318a5aa8f437a9536d192877354
https://doi.org/10.1515/9783110807486.81
https://doi.org/10.1515/9783110807486.81
