A randomized sublinear time parallel GCD algorithm for the EREW PRAM

We present a randomized parallel algorithm that computes the greatest common divisor of two integers of n bits in length with probability 1 − o ( 1 ) that takes O ( n log log n / log n ) time using O ( n 6 + ϵ ) processors for any ϵ > 0 on the EREW PRAM parallel model of computation. The algorith...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information processing letters Ročník 110; číslo 5; s. 198 - 201
Hlavný autor:	Sorenson, Jonathan P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.02.2010 Elsevier Elsevier Sequoia S.A
Predmet:	Algorithm analysis Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computation Computer science; control theory; systems Exact sciences and technology Failure Greatest common divisor Integers Mathematical models Miscellaneous Number theoretic algorithms Parallel algorithms Probability Processors Randomized algorithms Smooth numbers Studies Theoretical computing Randomized algorithms Greatest common divisor Parallel algorithms Smooth numbers Algorithm analysis Number theoretic algorithms Parallel algorithm Processor Computer theory Probability Probability distribution Failures Integer Information processing Parallel computation Failure
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!