Search Results for ""

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 ...

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 series is said to be conditionally convergent iff it is convergent, the series of its positive terms diverges to positive infinity, and the series of its negative terms ...

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...

A strongly regular graph with parameters (n,k,a,c) has graph eigenvalues k, theta, and tau, where theta = ((a-c)+sqrt(Delta))/2 (1) tau = ((a-c)-sqrt(Delta))/2 (2) where ...

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 ...

Find a square number x^2 such that, when a given integer h is added or subtracted, new square numbers are obtained so that x^2+h=a^2 (1) and x^2-h=b^2. (2) This problem was ...

A complete set of mutually conjugate group elements. Each element in a group belongs to exactly one class, and the identity element (I=1) is always in its own class. The ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...