relaxation times for proteins
(0.001 seconds)
11—20 of 176 matching pages
11: 27.18 Methods of Computation: Primes
…
►It runs in time
.
…
►The AKS (Agrawal–Kayal–Saxena) algorithm is the first deterministic, polynomial-time, primality test.
That is to say, it runs in time
for some constant .
…
12: 27.19 Methods of Computation: Factorization
…
►Techniques for factorization of integers fall into three general classes: Deterministic algorithms, Type I probabilistic algorithms whose expected running time depends on the size of the smallest prime factor, and Type II probabilistic algorithms whose expected running time depends on the size of the number to be factored.
►Deterministic algorithms are slow but are guaranteed to find the factorization within a known period of time.
…
13: 35.4 Partitions and Zonal Polynomials
14: 4.12 Generalized Logarithms and Exponentials
15: 29.2 Differential Equations
…
►
…
16: 35.3 Multivariate Gamma and Beta Functions
17: 27.16 Cryptography
…
►Applications to cryptography rely on the disparity in computer time required to find large primes and to factor large integers.
…
►Procedures for finding such primes require very little computer time.
…
►If and are known, and can be determined (mod ) by straightforward calculations that require only a few minutes of machine time.
…
18: 35.1 Special Notation
…
►All matrices are of order , unless specified otherwise.
…
►
►
…
complex variables. | |
… | |
zero matrix. | |
identity matrix. | |
… | |
real symmetric matrices. | |
… | |
orthogonal matrix. | |
… |