Search Results for ""
2031 - 2040 of 2493 for Cut SetSearch Results
A function with k continuous derivatives is called a C^k function. In order to specify a C^k function on a domain X, the notation C^k(X) is used. The most common C^k space is ...
Cantor dust is a fractal that can be constructed using string rewriting beginning with a cell [0] and iterating the rules {0->[0 0 0; 0 0 0; 0 0 0],1->[1 0 1; 0 0 0; 1 0 1]}. ...
A dimension also called the fractal dimension, Hausdorff dimension, and Hausdorff-Besicovitch dimension in which nonintegral values are permitted. Objects whose capacity ...
A multiway system that generates causal networks which are all isomorphic as acyclic digraphs is said to exhibit causal invariance, and the causal network itself is also said ...
A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...
A triangle ABC formed by three circular arcs. By extending the arcs into complete circles, the points of intersection A^', B^', and C^' are obtained. This gives the three ...
A coequalizer of a pair of maps f,g:X->Y in a category is a map c:Y->C such that 1. c degreesf=c degreesg, where degrees denotes composition. 2. For any other map c^':Y->C^' ...
A module having dual properties with respect to a free module, as enumerated below. 1. Every free module is projective; every cofree module is injective. 2. For every module ...
The subset C of the Euclidean plane formed by the union of the x-axis, the line segment with interval [0,1] of the y-axis, and the sequence of segments with endpoints (1/n,0) ...
The complexity of a process or algorithm is a measure of how difficult it is to perform. The study of the complexity of algorithms is known as complexity theory. In general, ...
...
View search results from all Wolfram sites (35915 matches)

