You are here: Home :: Area NEM :: Mathematics

A. M. Stepanenkov

On the complexity of testing primality by homogeneous structures

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.

Discrete Mathematics and Applications, Walter de Gruyter

Print ISSN: 0924-9266
Volume: 13, 08/2003
Pages: 343 - 354

Show full article (external site)

Show all available items of this journal

 

Area NEM