TOPICS
Search

Search Results for ""


551 - 560 of 3209 for Subset sum problemSearch Results
The axioms formulated by Hausdorff (1919) for his concept of a topological space. These axioms describe the properties satisfied by subsets of elements x in a neighborhood ...
Let X be a locally convex topological vector space and let K be a compact subset of X. In functional analysis, Milman's theorem is a result which says that if the closed ...
The quotient space X/∼ of a topological space X and an equivalence relation ∼ on X is the set of equivalence classes of points in X (under the equivalence relation ∼) ...
A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...
A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...
A problem listed in a fall issue of Gazeta Matematică in the mid-1970s posed the question if x_1>0 and x_(n+1)=(1+1/(x_n))^n (1) for n=1, 2, ..., then are there any values ...
The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...
There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...
A geometric series sum_(k)a_k is a series for which the ratio of each two consecutive terms a_(k+1)/a_k is a constant function of the summation index k. The more general case ...
Let X be an infinite set of urelements, and let V(^*X) be an enlargement of V(X). Let H in V(^*X) be an algebra. Then H is hyperfinitely generated provided that it has a ...
1 ... 53|54|55|56|57|58|59 ... 321 Previous Next

...