About the Project

relaxation times for proteins

AdvancedHelp

(0.001 seconds)

11—20 of 176 matching pages

11: 27.18 Methods of Computation: Primes
It runs in time O ( ( ln n ) c ln ln ln n ) . … The AKS (Agrawal–Kayal–Saxena) algorithm is the first deterministic, polynomial-time, primality test. That is to say, it runs in time O ( ( ln n ) c ) for some constant c . …
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
35.4.2 Z κ ( 𝐈 ) = | κ | !  2 2 | κ | [ m / 2 ] κ 1 j < l ( κ ) ( 2 k j 2 k l j + l ) j = 1 ( κ ) ( 2 k j + ( κ ) j ) !
14: 4.12 Generalized Logarithms and Exponentials
4.12.7 ϕ ( x ) = exp exp x  times ( x x ) , x > 1 .
4.12.9 ψ ( x ) = + ln ln  times x , x > 1 ,
4.12.10 0 ln ln times x < 1 .
For C generalized logarithms, see Walker (1991). …
15: 29.2 Differential Equations
Figure 29.2.1: z -plane: singularities × × × of Lamé’s equation.
16: 35.3 Multivariate Gamma and Beta Functions
35.3.2 Γ m ( s 1 , , s m ) = 𝛀 etr ( 𝐗 ) | 𝐗 | s m 1 2 ( m + 1 ) j = 1 m 1 | ( 𝐗 ) j | s j s j + 1 d 𝐗 , s j , ( s j ) > 1 2 ( j 1 ) , j = 1 , , m .
35.3.3 B m ( a , b ) = 𝟎 < 𝐗 < 𝐈 | 𝐗 | a 1 2 ( m + 1 ) | 𝐈 𝐗 | b 1 2 ( m + 1 ) d 𝐗 , ( a ) , ( b ) > 1 2 ( m 1 ) .
35.3.4 Γ m ( a ) = π m ( m 1 ) / 4 j = 1 m Γ ( a 1 2 ( j 1 ) ) .
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 p and q are known, s and y s can be determined (mod n ) by straightforward calculations that require only a few minutes of machine time. …
18: 35.1 Special Notation
All matrices are of order m × m , unless specified otherwise. …
a , b complex variables.
𝟎 zero matrix.
𝐈 identity matrix.
𝐒 , 𝐓 , 𝐗 real symmetric matrices.
𝐇 orthogonal matrix.
19: 27.3 Multiplicative Properties
27.3.2 f ( n ) = r = 1 ν ( n ) f ( p r a r ) .
27.3.3 ϕ ( n ) = n p | n ( 1 p 1 ) ,
27.3.4 J k ( n ) = n k p | n ( 1 p k ) ,
27.3.5 d ( n ) = r = 1 ν ( n ) ( 1 + a r ) ,
27.3.10 f ( n ) = r = 1 ν ( n ) ( f ( p r ) ) a r .
20: 35.6 Confluent Hypergeometric Functions of Matrix Argument
35.6.2 Ψ ( a ; b ; 𝐓 ) = 1 Γ m ( a ) 𝛀 etr ( 𝐓 𝐗 ) | 𝐗 | a 1 2 ( m + 1 ) | 𝐈 + 𝐗 | b a 1 2 ( m + 1 ) d 𝐗 , ( a ) > 1 2 ( m 1 ) , 𝐓 𝛀 .
35.6.6 B m ( b 1 , b 2 ) | 𝐓 | b 1 + b 2 1 2 ( m + 1 ) F 1 1 ( a 1 + a 2 b 1 + b 2 ; 𝐓 ) = 𝟎 < 𝐗 < 𝐓 | 𝐗 | b 1 1 2 ( m + 1 ) F 1 1 ( a 1 b 1 ; 𝐗 ) | 𝐓 𝐗 | b 2 1 2 ( m + 1 ) F 1 1 ( a 2 b 2 ; 𝐓 𝐗 ) d 𝐗 , ( b 1 ) , ( b 2 ) > 1 2 ( m 1 ) .