848 search results - page 5 / 170 » Randomness and the linear degrees of computability |
ISSAC
2005
Springer
14 years 2 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....
JSYML
2007
13 years 8 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
RANDOM
1999
Springer
14 years 24 days ago
1999
Springer
SC
2004
ACM
14 years 2 months ago
2004
ACM
The solution of elliptic diffusion operators is the computational bottleneck in many simulations in a wide range of engineering and scientific disciplines. We present a truly sca...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE