Search Results for ""

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

The determination of whether a Turing machine will come to a halt given a particular input program. The halting problem is solvable for machines with less than four states. ...

One of the numbers ..., -2, -1, 0, 1, 2, .... The set of integers forms a ring that is denoted Z. A given integer n may be negative (n in Z^-), nonnegative (n in Z^*), zero ...

The function intx gives the integer part of x. In many computer languages, the function is denoted int(x). It is related to the floor and ceiling functions |_x_| and [x] by ...

Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...

Any method which solves a problem by generating suitable random numbers and observing that fraction of the numbers obeying some property or properties. The method is useful ...

The multicomputational paradigm is a generalization of the computational paradigm to many computational threads of time. In the ordinary computational paradigm, time ...

A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...