Search Results for ""

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

In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...

A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...

The determination of the number of monotone Boolean functions of n variables (equivalent to the number of antichains on the n-set {1,2,...,n}) is called Dedekind's problem, ...

Consider a set A_n={a_1,a_2,...,a_n} of n positive integer-denomination postage stamps sorted such that 1=a_1<a_2<...<a_n. Suppose they are to be used on an envelope with ...

The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...