Search Results for ""
241 - 250 of 736 for COMPLEXITYSearch Results

If K is a simplicial complex, let V be the vertex set of K. Furthermore, let K be the collection of all subsets {a_0,...,a_n} of V such that the vertices a_0, ..., a_n span a ...
The system of partial differential equations (partial_t+partial_z^3+partial_(z^_)^3)v+partial_z(uv)+partial_(z^_)(vw) (1) partial_(z^_)u=3partial_zv (2) ...
Let f be a family of meromorphic functions on the unit disk D which are not normal at 0. Then there exist sequences f_n in F, z_n, rho_n, and a nonconstant function f ...
An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...
A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...
For discrete problems in which no efficient solution method is known, it might be necessary to test each possibility sequentially in order to determine if it is the solution. ...
The absolute value of a real number x is denoted |x| and defined as the "unsigned" portion of x, |x| = xsgn(x) (1) = {-x for x<=0; x for x>=0, (2) where sgn(x) is the sign ...
There are at least two statements which go by the name of Artin's conjecture. If r is any complex finite-dimensional representation of the absolute Galois group of a number ...
Let the characteristic polynomial of an n×n complex matrix A be written in the form P(lambda) = |lambdaI-A| (1) = ...
A bilinear form on a real vector space is a function b:V×V->R that satisfies the following axioms for any scalar alpha and any choice of vectors v,w,v_1,v_2,w_1, and w_2. 1. ...

...