TOPICS
Search

Search Results for ""


451 - 460 of 3209 for Subset sum problemSearch Results
If at least one solution can be determined for a given problem, a solution to that problem is said to exist. Frequently, mathematicians seek to prove the existence of ...
A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...
A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...
In 1638, Fermat proposed that every positive integer is a sum of at most three triangular numbers, four square numbers, five pentagonal numbers, and n n-polygonal numbers. ...
The geometry resulting from the application of the inversion operation. It can be especially powerful for solving apparently difficult problems such as Steiner's porism and ...
Given a module M over a commutative unit ring R and a filtration F:... subset= I_2 subset= I_1 subset= I_0=R (1) of ideals of R, the Rees module of M with respect to F is ...
Let A:D(A)->H and B:D(B)->H be linear operators from domains D(A) and D(B), respectively, into a Hilbert space H. It is said that B extends A if D(A) subset D(B) and if Bv=Av ...
In general, the word "complement" refers to that subset F^' of some set S which excludes a given subset F. Taking F and its complement F^' together then gives the whole of ...
A list of five properties of a topological space X expressing how rich the "population" of open sets is. More precisely, each of them tells us how tightly a closed subset can ...
The Kiepert hyperbola is a hyperbola and triangle conic that is related to the solution of Lemoine's problem and its generalization to isosceles triangles constructed on the ...
1 ... 43|44|45|46|47|48|49 ... 321 Previous Next

...