Article
Licensed
Unlicensed
Requires Authentication
On the complexity of testing primality by homogeneous structures
-
A. M. Stepanenkov
Published/Copyright:
August 1, 2003
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.
Published Online: 2003-08-01
Published in Print: 2003-08-01
Copyright 2003, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Boolean reducibility
- On the complexity of testing primality by homogeneous structures
- On distinguishability of states of automata
- On glueing states of an automaton
- Almost layer-finiteness of the periodic part of groups without involutions
- The structure and methods of generation of closed classes of graphs
- On asymptotic expansions for the distributions of the number of cycles in a random permutation
Articles in the same Issue
- Boolean reducibility
- On the complexity of testing primality by homogeneous structures
- On distinguishability of states of automata
- On glueing states of an automaton
- Almost layer-finiteness of the periodic part of groups without involutions
- The structure and methods of generation of closed classes of graphs
- On asymptotic expansions for the distributions of the number of cycles in a random permutation
