TOPICS
Search

Search Results for ""


391 - 400 of 2910 for Integer complexitySearch Results
A real normed algebra, also called a composition algebra, is a multiplication * on R^n that respects the length of vectors, i.e., |x*y|=|x|*|y| for x,y in R^n. The only real ...
The reciprocal of a real or complex number z!=0 is its multiplicative inverse 1/z=z^(-1), i.e., z to the power -1. The reciprocal of zero is undefined. A plot of the ...
The Riemann theta function is a complex function of g complex variables that occurs in the construction of quasi-periodic solutions of various equations in mathematical ...
The turning of an object or coordinate system by an angle about a fixed point. A rotation is an orientation-preserving orthogonal transformation. Euler's rotation theorem ...
Let A=a_(ij) be an n×n matrix with complex (or real) entries and eigenvalues lambda_1, lambda_2, ..., lambda_n, then sum_(i=1)^n|lambda_i|^2<=sum_(i,j=1)^n|a_(ij)|^2 (1) ...
The j-function is the modular function defined by j(tau)=1728J(tau), (1) where tau is the half-period ratio, I[tau]>0, ...
There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...
A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...
Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...
A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...
1 ... 37|38|39|40|41|42|43 ... 291 Previous Next

...