TOPICS
Search

Search Results for ""


41 - 50 of 831 for Computer programmingSearch Results
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 ...
A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...
A set of ascending sequences in a permutation is called a run (Graham et al. 1994) or sometimes a rise (Comtet 1974, p. 241). A sorted permutation consists of a single run, ...
A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...
The Erdős-Borwein constant E, sometimes also denoted alpha, is the sum of the reciprocals of the Mersenne numbers, E = sum_(n=1)^(infty)1/(2^n-1) (1) = ...
The exponent laws, also called the laws of indices (Higgens 1998) or power rules (Derbyshire 2004, p. 65), are the rules governing the combination of exponents (powers). The ...
The sum over all external (square) nodes of the lengths of the paths from the root of an extended binary tree to each node. For example, in the tree above, the external path ...
The fibonomial coefficient (sometimes also called simply the Fibonacci coefficient) is defined by [m; k]_F=(F_mF_(m-1)...F_(m-k+1))/(F_1F_2...F_k), (1) where [m; 0]_F=1 and ...
A tree which is not rooted, i.e., a normal tree with no node singled out for special treatment (Skiena 1990, p. 107). Free trees are sometimes known instead as unrooted trees ...
At rational arguments p/q, the digamma function psi_0(p/q) is given by psi_0(p/q)=-gamma-ln(2q)-1/2picot(p/qpi) +2sum_(k=1)^([q/2]-1)cos((2pipk)/q)ln[sin((pik)/q)] (1) for ...
1|2|3|4|5|6|7|8 ... 84 Previous Next

...