The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 16 of 16

Showing per page

Order by Relevance | Title | Year of publication

Exponents in Archimedean Arthur packets

Nicolas BergeronLaurent Clozel — 2013

Annales de l’institut Fourier

Generalizing the proof – by Hecht and Schmid – of Osborne’s conjecture we prove an Archimedean (and weaker) version of a theorem of Colette Moeglin. The result we obtain is a precise Archimedean version of the general principle – stated by the second author – according to which

Efficient computation of addition chains

F. BergeronJ. BerstelS. Brlek — 1994

Journal de théorie des nombres de Bordeaux

The aim of this paper is to present a unifying approach to the computation of short addition chains. Our method is based upon continued fraction expansions. Most of the popular methods for the generation of addition chains, such as the binary method, the factor method, etc..., fit in our framework. However, we present new and better algorithms. We give a general upper bound for the complexity of continued fraction methods, as a function of a chosen strategy, thus the total number of operations required...

Page 1

Download Results (CSV)