ISSAC
1998
Springer
13 years 8 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
ARITH
1999
IEEE
13 years 8 months ago
1999
IEEE
A digit-recurrence algorithm for computing the Euclidean norm of a 3-dimensional vector is proposed. Starting from the vector component with the highest order of magnitude as the ...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...