Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
We present a cgal-based univariate algebraic kernel, which provides certied real-root isolation of univariate polynomials with integer coecients and standard functionalities such...
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...