99 search results - page 1 / 20 » Inspection by Implicit Polynomials |
ICIAP
1999
ACM
13 years 9 months ago
1999
ACM
PKC
2009
Springer
14 years 5 months ago
2009
Springer
We address the problem of polynomial time factoring RSA moduli N1 = p1q1 with the help of an oracle. As opposed to other approaches that require an oracle that explicitly outputs b...
JSC
2010
12 years 11 months ago
2010
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
IANDC
2006
13 years 5 months ago
2006
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
IJCV
2010
13 years 3 months ago
2010
Abstract The use of traditional moment invariants in object recognition is limited to simple geometric transforms, such as rotation, scaling and affine transformation of the image...