1380 search results - page 41 / 276 » A General Polynomial Sieve |
PODS
2007
ACM
14 years 8 months ago
2007
ACM
Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO...
MOR
2006
13 years 8 months ago
2006
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
SIAMCOMP
2010
13 years 3 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
AMC
2010
13 years 8 months ago
2010
In this paper properties of cell matrices are studied. A determinant of such a matrix is given in a closed form. In the proof a general method for determining a determinant of a s...