Search Results for ""
611 - 620 of 2910 for Integer complexitySearch Results
In simple algebra, multiplication is the process of calculating the result when a number a is taken b times. The result of a multiplication is called the product of a and b, ...
The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...
The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...
Catalan's constant is a constant that commonly appears in estimates of combinatorial functions and in certain classes of sums and definite integrals. It is usually denoted K ...
The game of life is the best-known two-dimensional cellular automaton, invented by John H. Conway and popularized in Martin Gardner's Scientific American column starting in ...
A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...
Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...
The permanent is an analog of a determinant where all the signs in the expansion by minors are taken as positive. The permanent of a matrix A is the coefficient of x_1...x_n ...
Let F(nu) and G(nu) be the Fourier transforms of f(t) and g(t), respectively. Then int_(-infty)^inftyf(t)g^_(t)dt ...
The word residue is used in a number of different contexts in mathematics. Two of the most common uses are the complex residue of a pole, and the remainder of a congruence. ...
...
View search results from all Wolfram sites (340627 matches)

