Search Results for ""

Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

Disconnectivities are mathematical entities which stand in the way of a space being contractible (i.e., shrunk to a point, where the shrinking takes place inside the space ...

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...

An Abelian variety which is canonically attached to an algebraic variety which is the solution to a certain universal problem. The Albanese variety is dual to the Picard ...

The only whole number solution to the Diophantine equation y^3=x^2+2 is y=3, x=+/-5. This theorem was offered as a problem by Fermat, who suppressed his own proof.

For a given n, is the problem of determining if a set is mortal solvable? n=1 is solvable, n=2 is unknown, and n>=3 is unsolvable.

The problem of forecasting future values X_(t+tau) (tau>0) of a weakly stationary process {X_t} from the known values X_s (s<=t).

A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.

The small world problem asks for the probability that two people picked at random have at least one acquaintance in common.