135 search results - page 16 / 27 » Improved dense multivariate polynomial factorization algorit... |
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
TCS
2008
13 years 7 months ago
2008
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
BMCBI
2007
13 years 7 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...