TOPICS
Search

Search Results for ""


11111 - 11120 of 13135 for Book GraphSearch Results
While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...
Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...
Concentric circles are circles with a common center. The region between two concentric circles of different radii is called an annulus. Any two circles can be made concentric ...
A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...
A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...
A conic projection of points on a unit sphere centered at O consists of extending the line OS for each point S until it intersects a cone with apex A which tangent to the ...
A conical frustum is a frustum created by slicing the top off a cone (with the cut made parallel to the base). For a right circular cone, let s be the slant height and R_1 ...
The homomorphism S which, according to the snake lemma, permits construction of an exact sequence (1) from the above commutative diagram with exact rows. The homomorphism S ...
The Connell sequence is the sequence obtained by starting with the first positive odd number (1), taking the next two even numbers (2, 4), the next three odd numbers (5, 7, ...
Given an expression involving known constants, integration in finite terms, computation of limits, etc., the constant problem is the determination of if the expression is ...

...