24 search results - page 3 / 5 » The complexity of greatest common divisor computations |
ICIP
1997
IEEE
14 years 9 months ago
1997
IEEE
In this paper we examine the applicability of the previously proposed Greatest Common Divisor (GCD) method to blind image deconvolution. In this method, the desired image is appro...
ISSAC
2004
Springer
14 years 22 days ago
2004
Springer
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
DISCO
1993
13 years 11 months ago
1993
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
COCO
1999
Springer
13 years 11 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
ICS
1993
Tsinghua U.
13 years 11 months ago
1993
Tsinghua U.
—Data dependence analysis techniques are the main component of today’s strategies for automatic detection of parallelism. Parallelism detection strategies are being incorporate...