TOPICS
Search

Search Results for ""


5581 - 5590 of 13134 for complexity theorySearch Results
Let n points xi_1, ..., xi_n be randomly distributed on a domain S, and let H be some event that depends on the positions of the n points. Let S^' be a domain slightly ...
A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...
The science of adversarial information protection.
A cubefree word contains no cubed words as subwords. The number of binary cubefree words of length n=1, 2, ... are 2, 4, 6, 10, 16, 24, 36, 56, 80, 118, ... (OEIS A028445). ...
A coordinate system composed of intersecting surfaces. If the intersections are all at right angles, then the curvilinear coordinates are said to form an orthogonal ...
A cusp catastrophe is a catastrophe which can occur for two control factors and one behavior axis. The cusp catastrophe is the universal unfolding of the singularity f(x)=x^4 ...
The cylinder function is defined as C(x,y)={1 for sqrt(x^2+y^2)<=a; 0 for sqrt(x^2+y^2)>a. (1) The Bessel functions are sometimes also called cylinder functions. To find the ...
The decimal period of a repeating decimal is the number of digits that repeat. For example, 1/3=0.3^_ has decimal period one, 1/11=0.09^_ has decimal period two, and ...
Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...
Given binomial coefficient (N; k), write N-k+i=a_ib_i, for 1<=i<=k, where b_i contains only those prime factors >k. Then the number of i for which b_i=1 (i.e., for which all ...
1 ... 556|557|558|559|560|561|562 ... 1314 Previous Next

...