TOPICS
Search

Search Results for ""


111 - 120 of 276 for ComputeSearch Results
The metabigyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating two of the pentagonal cupolas of a small rhombicosidodecahedron located in the ...
A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...
A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...
Möbius tetrahedra, also called Möbius tetrads (Baker 1922, pp. 61-62) are a pair of tetrahedra, each of which has all the vertices lying on the faces of the other: in other ...
A diagram lemma also known as 3×3 lemma. According to its most general statement, the commutative diagram illustrated above with exact rows and columns can be completed by ...
Given a triangle DeltaABC, construct the contact triangle DeltaDEF. Then the Nobbs points are the intersections of the corresponding sides of triangles DeltaABC and DeltaDEF, ...
A nondeterministic Turing machine is a "parallel" Turing machine that can take many computational paths simultaneously, with the restriction that the parallel Turing machines ...
Consider the average volume of a tetrahedron picked at random inside an octahedron of unit volume. The answer is difficult to compute analytically (Zinani 2003), but the mean ...
To solve the system of differential equations (dx)/(dt)=Ax(t)+p(t), (1) where A is a matrix and x and p are vectors, first consider the homogeneous case with p=0. The ...
The pentakis dodecahedron is the 60-faced dual polyhedron of the truncated icosahedron A_(11) (Holden 1971, p. 55). It is Wenninger dual W_9. It can be constructed by ...
1 ... 9|10|11|12|13|14|15 ... 28 Previous Next

...