TOPICS
Search

Search Results for ""


231 - 240 of 1636 for Bin Packing ProblemSearch Results
A perfect cuboid is a cuboid having integer side lengths, integer face diagonals d_(ab) = sqrt(a^2+b^2) (1) d_(ac) = sqrt(a^2+c^2) (2) d_(bc) = sqrt(b^2+c^2), (3) and an ...
The number of degrees of freedom in a problem, distribution, etc., is the number of parameters which may be independently varied.
A specific prescription for carrying out a task or solving a problem. Also called an algorithm, method, or technique
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 ...
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 ...
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 ...
The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...
A cube can be divided into n subcubes for only n=1, 8, 15, 20, 22, 27, 29, 34, 36, 38, 39, 41, 43, 45, 46, and n>=48 (OEIS A014544; Hadwiger 1946; Scott 1947; Gardner 1992, ...
The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the ...
Define g(k) as the quantity appearing in Waring's problem, then Euler conjectured that g(k)=2^k+|_(3/2)^k_|-2, where |_x_| is the floor function.
1 ... 21|22|23|24|25|26|27 ... 164 Previous Next

...