Search Results for ""
2921 - 2930 of 13134 for complexity theorySearch Results
Let N be an odd integer, and assume there exists a Lucas sequence {U_n} with associated Sylvester cyclotomic numbers {Q_n} such that there is an n>sqrt(N) (with n and N ...
An operator relating the asymptotic state of a dynamical system governed by the Schrödinger equation ihd/(dt)psi(t)=Hpsi(t) to its original asymptotic state.
Any discrete finite wavelet transform can be represented as a matrix, and such a wavelet matrix can be computed in O(n) steps, compared to O(nlgn) for the Fourier matrix, ...
A sequence of numbers V={nu_n} is said to be weakly complete if every positive integer n beyond a certain point N is the sum of some subsequence of V (Honsberger 1985). ...
A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...
An optimal filter used for the removal of noise from a signal which is corrupted by the measuring process itself.
A knot which is not a tame knot.
Constants gamma such that [int_Omega|f|^qdx]^(1/q)<=gamma[int_Omegasum_(i=1)^N|(partialf)/(partialx_i)|^pdx]^(1/p), where f is a real-valued smooth function on a region Omega ...
A witness is a number which, as a result of its number theoretic properties, guarantees either the compositeness or primality of a number n. Witnesses are most commonly used ...
The sequence {F_n-1} is complete even if restricted to subsequences which contain no two consecutive terms, where F_n is a Fibonacci number.
...
View search results from all Wolfram sites (28442 matches)

