Gaussian Laws for the Main Parameters of the Euclid Algorithms

We provide sharp estimates for the probabilistic behaviour of the main parameters of the Euclid Algorithms, both on polynomials and on integer numbers. We study in particular the distribution of the bit-complexity which involves two main parameters: digit-costs and length of remainders. We first sho...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 50; číslo 4; s. 497 - 554
Hlavní autori:	Lhote, Loïck, Vallée, Brigitte
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	New York Springer-Verlag 01.04.2008 Springer
Predmet:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Mathematics of Computing Theoretical computing Theory of Computation Dynamical analysis of algorithms Tauberian theorems Average-case analysis Transfer operator Perron’s formula Analysis of algorithms Dynamical systems Euclid’s algorithms Distributional analysis Asymptotic Gaussian laws Probabilistic approach Generating function Similarity Euclidean theory Distributional analysis· Dynamical systems Gaussian distribution Perron's formula .Dynamical analysis of algorithms Polynomial method Dynamical system Modeling Euclid's algorithms· Analysis of algorithms· Average-case analysis Bézout idendity Greatest commun divisor Asymptotic approximation Regularity Algorithm analysis Number theory
ISSN:	0178-4617, 1432-0541
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!