1380 search results - page 50 / 276 » A General Polynomial Sieve |
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
We consider the implications of the equivalence of commutative semifields of odd order and planar Dembowski-Ostrom polynomials. This equivalence was outlined recently by Coulter an...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
JUCS
2007
13 years 8 months ago
2007
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
MP
2010
13 years 7 months ago
2010
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...