Search Results for ""
851 - 860 of 3209 for Subset sum problemSearch Results
A board is a subset of the polygons determined by a number of (usually regularly spaced and oriented) lines. These polygons form the spaces on which "pieces" can be placed ...
The subset B of the Euclidean plane formed by the union of the interval [0,1] of the x-axis and all line segments of unit length passing through the origin which form an ...
In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a floating-point representation is an unencoded member of a floating-point format which represents either ...
A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...
A d-dimensional discrete percolation model on a regular point lattice L=L^d is said to be oriented if L is an oriented lattice. One common such model takes place on the ...
Let x:U->R^3 be a regular patch, where U is an open subset of R^2. Then (partiale)/(partialv)-(partialf)/(partialu) = eGamma_(12)^1+f(Gamma_(12)^2-Gamma_(11)^1)-gGamma_(11)^2 ...
A point process is a probabilistic model for random scatterings of points on some space X often assumed to be a subset of R^d for some d. Oftentimes, point processes describe ...
The total angular defect is the sum of the angular defects over all polyhedron vertices of a polyhedron, where the angular defect delta at a given polyhedron vertex is the ...
A number x in which the first n decimal digits of the fractional part frac(x) sum to 666 is known as an evil number (Pegg and Lomont 2004). However, the term "evil" is also ...
The q-binomial coefficient is a q-analog for the binomial coefficient, also called a Gaussian coefficient or a Gaussian polynomial. A q-binomial coefficient is given by [n; ...
...
View search results from all Wolfram sites (180219 matches)

