|
On the complexity of testing for the primality of a number by homogeneous structures
A. M. Stepanenkov
Abstract:
In this paper, it is shown that under Turing coding of natural numbers primality of
a number is tested by homogeneous structures in time asymptotically equal
to the half of the length of the code. The research was supported by the Russian Foundation of Basic Research, grant
02–01–00162.
Received: 11.10.2002
Citation:
A. M. Stepanenkov, “On the complexity of testing for the primality of a number by homogeneous structures”, Diskr. Mat., 15:3 (2003), 54–65; Discrete Math. Appl., 13:4 (2003), 343–354
Linking options:
https://www.mathnet.ru/eng/dm205https://doi.org/10.4213/dm205 https://www.mathnet.ru/eng/dm/v15/i3/p54
|
| Statistics & downloads: |
| Abstract page: | 550 | | Full-text PDF : | 391 | | References: | 71 | | First page: | 1 |
|