TOPICS
Search

Search Results for ""


6461 - 6470 of 13134 for complexity theorySearch Results
The concatenation of two strings a and b is the string ab formed by joining a and b. Thus the concatenation of the strings "book" and "case" is the string "bookcase". The ...
A function f(x) is said to be concave on an interval [a,b] if, for any points x_1 and x_2 in [a,b], the function -f(x) is convex on that interval (Gradshteyn and Ryzhik 2000).
A concave polygon is a polygon that is not convex. A simple polygon is concave iff at least one of its internal angles is greater than 180 degrees. An example of a non-simple ...
A concho-spiral, also known as a conchospiral, is a space curve with parametric equations r = mu^ua (1) theta = u (2) z = mu^uc, (3) where mu, a, and c are fixed parameters. ...
A conclusion is a statement arrived at by applying a set of logical rules known as syllogisms to a set of premises. The process of drawing conclusions from premises and ...
Two or more lines which intersect in a point are said to concur.
A requirement necessary for a given statement or theorem to hold. Also called a criterion.
The formal term in propositional calculus for the connective implies.
The conditional probability of an event A assuming that B has occurred, denoted P(A|B), equals P(A|B)=(P(A intersection B))/(P(B)), (1) which can be proven directly using a ...
A set X is called a "cone" with vertex at the origin if for any x in X and any scalar a>=0, ax in X.
1 ... 644|645|646|647|648|649|650 ... 1314 Previous Next

...