𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic Algorithms in Finite Fields

✍ Scribed by Rabin, Michael O.

Book ID
118174060
Publisher
Society for Industrial and Applied Mathematics
Year
1980
Tongue
English
Weight
1017 KB
Volume
9
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithms for Exponentiation in Finite
Algorithms for Exponentiation in Finite Fields
✍ Shuhong Gao; Joachim Von zur gathen; Daniel Panario; Victor Shoup πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 298 KB

Gauss periods yield (self-dual) normal bases in finite fields, and these normal bases can be used to implement arithmetic efficiently. It is shown that for a small prime power q and infinitely many integers n, multiplication in a normal basis of F q n over Fq can be computed with O(n log n loglog n)

Genetic algorithms in probabilistic fini
Genetic algorithms in probabilistic finite element analysis of geotechnical problems
✍ Lijie Cui; Daichao Sheng πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 225 KB

In application to numerical analysis of geotechnical problems, the limit-state surface is usually not known in any closed form. The probability of failure can be assessed via the so-called reliability index. A minimization problem can naturally be formed with an implicit equality constraint defined