Sciweavers

577 search results - page 37 / 116
» Computing Rational Bisectors
Sort
View
ANTS
2006
Springer
79views Algorithms» more  ANTS 2006»
13 years 11 months ago
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
John Cremona, Samir Siksek
JUCS
2008
122views more  JUCS 2008»
13 years 8 months ago
On the Subrecursive Computability of Several Famous Constants
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
Dimiter Skordev
SMA
2009
ACM
130views Solid Modeling» more  SMA 2009»
14 years 2 months ago
A symbolic-numerical envelope algorithm using quadratic MOS patches
In this paper, we describe an algorithm for generating an exact rational envelope of a two-parameter family of spheres given by a quadratic patch in R3,1 , which is considered as ...
Bohumír Bastl, Jirí Kosinka, Mirosla...
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 1 months ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran
AUTOMATICA
2002
81views more  AUTOMATICA 2002»
13 years 7 months ago
A convex approach to the characterization of the frequency response of ellipsoidal plants
This paper deals with the frequency domain properties of an ellipsoidal family of rational functions, i.e. a family of rational functions whose coefficients depend affinely on an ...
Graziano Chesi, Andrea Garulli, Alberto Tesi, Anto...