Perfect power testing

Bach and Sorenson present two algorithms for testing whether a number n is a perfect power, with average running time O( log 2 n) under the assumption that n is chosen uniformly from an interval of length at least ( log n) 3 log log log n . We modify their algorithms to reduce the interval to polyno...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 58; číslo 2; s. 59 - 63
Hlavní autoři: Balasubramanian, R., Nagaraj, S.V.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 22.04.1996
Elsevier Science
Elsevier Sequoia S.A
Témata:
Algebra
Algorithmics. Computability. Computer arithmetics
Algorithms
Analysis of algorithms
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Information processing
Mathematical models
Mathematics
Number theoretic algorithms
Number theory
Perfect powers
Sciences and techniques of general use
Studies
Theoretical computing
Analysis of algorithms
Perfect powers
Number theoretic algorithms
Algorithm analysis
Number theory
Algorithms
ISSN:0020-0190, 1872-6119
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Bach and Sorenson present two algorithms for testing whether a number n is a perfect power, with average running time O( log 2 n) under the assumption that n is chosen uniformly from an interval of length at least ( log n) 3 log log log n . We modify their algorithms to reduce the interval to polynomial size.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(96)00042-7