Search Results for ""
301 - 310 of 3209 for Subset sum problemSearch Results
A subset A subset= X of a topological space X is said to be disconnected if it is not connected.
A function f defined on a subset S subset R^n is said to be pseudoconcave if -f is pseudoconvex.
The roots of a semisimple Lie algebra g are the Lie algebra weights occurring in its adjoint representation. The set of roots form the root system, and are completely ...
A set in which no element divides the sum of any nonempty subset of the other elements. For example, {2,3,5} is dividing, since 2|(3+5) (and 5|(2+3)), but {4,6,7} is ...
Given a complex measure mu, there exists a positive measure denoted |mu| which measures the total variation of mu, also sometimes called simply "total variation." In ...
The rank polynomial R(x,y) of a general graph G is the function defined by R(x,y)=sum_(S subset= E(G))x^(r(S))y^(s(S)), (1) where the sum is taken over all subgraphs (i.e., ...
An equation is said to be a closed-form solution if it solves a given problem in terms of functions and mathematical operations from a given generally-accepted set. For ...
For d>=1, Omega an open subset of R^d, p in [1;+infty] and s in N, the Sobolev space W^(s,p)(R^d) is defined by W^(s,p)(Omega)={f in L^p(Omega): forall ...
The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...
For a given m, determine a complete list of fundamental binary quadratic form discriminants -d such that the class number is given by h(-d)=m. Heegner (1952) gave a solution ...
...
View search results from all Wolfram sites (180219 matches)

