425 search results - page 23 / 85 » Polynomial Factorization 1987-1991 |
ISSAC
2009
Springer
14 years 1 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...
GC
2002
Springer
13 years 7 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
PKC
2010
Springer
13 years 9 months ago
2010
Springer
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...