1. Главная
  2. Ресурсы
  3. Библиотечный поиск
Riemann's Hypothesisand tests forprimality Gary L. Miller1975 год

Riemann's Hypothesis and tests for primality
статья

Полный текстСтраница публикацииПубликация в OpenAlex
Аннотация: The purpose of this paper is to present new upper bounds on the complexity of algorithms for testing the primality of a number. The first upper bound is 0(n1/7); it improves the previously best known bound of 0(n1/4) due to Pollard [11].
Год издания: 1975
Авторы: Gary L. Miller
Ключевые слова: Coding theory and cryptography, graph theory and CDMA systems, semigroups and automata theory