FSTTCS
2010
Springer
13 years 9 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
MLQ
2002
13 years 10 months ago
2002
A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limi...
RML
2006
13 years 10 months ago
2006
Abstract. A topos version of Cantor's back and forth theorem is established and used to prove that the ordered structure of the rational numbers Q, < is homogeneous in any ...
FC
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
ISSAC
2005
Springer
14 years 4 months ago
2005
Springer
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....