Search Results for ""

The approximation problem is a well known problem of functional analysis (Grothendieck 1955). It asks to determine whether every compact operator T from a Banach space X to a ...

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

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

An initial value problem is a problem that has its conditions specified at some time t=t_0. Usually, the problem is an ordinary differential equation or a partial ...

Let E be a set of expressions representing real, single-valued partially defined functions of one real variable. Let E^* be the set of functions represented by expressions in ...

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.

Deciding whether a given Boolean formula in conjunctive normal form has an assignment that makes the formula "true." In 1971, Cook showed that the problem is NP-complete.

To predict the result of a measurement requires (1) a model of the system under investigation, and (2) a physical theory linking the parameters of the model to the parameters ...

The moment problem, also called "Hausdorff's moment problem" or the "little moment problem," may be stated as follows. Given a sequence of numbers {mu_n}_(n=0)^infty, under ...