Sciweavers

10 search results - page 1 / 2
» Rational Divisors in Rational Divisor Classes
Sort
View
ANTS
2004
Springer
74views Algorithms» more  ANTS 2004»
14 years 4 months ago
Rational Divisors in Rational Divisor Classes
We discuss the situation where a curve C, defined over a number field K, has a known K-rational divisor class of degree 1, and consider whether this class contains an actual K-ra...
Nils Bruin, E. Victor Flynn
JGO
2008
83views more  JGO 2008»
13 years 11 months ago
Global minimization of rational functions and the nearest GCDs
This paper discusses the global minimization of rational functions with or without constraints. We studied the sum of squares (SOS) relaxations and their properties to solve this ...
Jiawang Nie, James Demmel, Ming Gu
ISSAC
1997
Springer
125views Mathematics» more  ISSAC 1997»
14 years 3 months ago
A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...
Ziming Li, István Nemes
TCS
2008
13 years 11 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
FFA
2007
62views more  FFA 2007»
13 years 11 months ago
On the parameters of r-dimensional toric codes
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...
Diego Ruano